Topic
ω-automaton
About: ω-automaton is a research topic. Over the lifetime, 2299 publications have been published within this topic receiving 68468 citations. The topic is also known as: stream automaton & ω-automata.
Papers published on a yearly basis
Papers
More filters
•
TL;DR: In this paper, the computational power of hybrid extended finite automata is investigated, and the corresponding families of languages in the Chomsky hierarchy are compared with each other, demonstrating that there exist dependencies and independencies between the input manipulating operations.
Abstract: Extended finite automata are finite state automata equipped with the additional ability to apply an operation on the currently remaining input word, depending on the current state. Hybrid extended finite automata can choose from a finite set of such operations. In this paper, five word operations are taken into consideration which always yield letter-equivalent results, namely reversal and shift operations. The computational power of those machines is investigated, locating the corresponding families of languages in the Chomsky hierarchy. Furthermore, different types of hybrid extended finite automata, defined by the set of operations they are allowed to apply, are compared with each other, demonstrating that there exist dependencies and independencies between the input manipulating operations.
2 citations
••
2 citations
••
TL;DR: In this article, the authors considered the defects in controllable systems described by the finite automaton model and proposed a control ensuring total decoupling from the actions caused by the defects.
Abstract: Consideration was given to accommodation to the defects in controllable systems described by the finite automaton model Solution of this problem was related with generation of the control ensuring total decoupling from the actions caused by the defects For determination of the control law, the existence conditions were formulated, and the design formulas were proposed
2 citations
••
2 citations
••
TL;DR: F fuzzy automaton is better than finite automaton for strings comparison when individual levels of similarity for particular pairs of symbols or sequences of symbols are defined.
Abstract: In this paper, a method has been presented to convert finite automaton to fuzzy automaton as fuzzy automaton is better than finite automaton for strings comparison when individual levels of similarity for particular pairs of symbols or sequences of symbols are defined. A finite automaton is useful in determining whether a given string is accepted or not whereas fuzzy automaton determines the extent to which the string is accepted.
2 citations