ω-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.

Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata

Abstract: A two-dimensional nondeterministic on-line tessellation acceptor (2-NOTA) is a special type of real-time two-dimensional nondeterministic cellular automaton in which data flows from the upper-left corner to the lower-right corner. A two-dimensional alternating finite automaton (2-AFA) is an alternating finite automaton with a two-dimensional rectangular input whose input head can move in all four directions on the input. In this paper, we show that 2-NOTA's and 2-AFA's are incomparable. This answers in the negative an open question in [IT89a]. Closure properties of the classes of languages (i.e., sets of two-dimensional patterns) accepted by two-way, three-way, and four-way two-dimensional alternating finite automata and two-dimensional alternating finite automata with only universal states are also obtained which answer several open questions in [IN88].

Relating automata to other fields

Abstract: Automata classes including Turing Machines, Pushdown Automata and Finite Automata define the most elegant models of computation in terms of set processors. This study elaborates pedagogically motivated intuitive and formal relations between mathematical models and other computer science areas, so that students can relate different areas of computer science in a meaningful way. Cases that promote learning about theoretical models are presented with other related areas, such as programming languages, compilers and software design. Dynamic aspects of software can be appropriately modeled by certain automata based models. Visualizations are developed to help students in their initial stages of understanding of these relations. The visualizations demonstrate that mathematical models such as Pushdown Automata are reasonable processors of some programming language features such as balanced {'s and }'s which are evidently helpful in learning this kind of relation.

On rational solution of the state equation of a finite automaton

Abstract: We prove that the necessary and sufficient condition for the state equation of a finite automaton M to have a rational solution is that the lexicographical Godel numbers of the strings belonging to each of the end-sets of M form an ultimately periodic set. A method of determining the existence of a rational solution of the state equation is also given.

A service composition model based on finite state automata

Abstract: The existing conditions and problems of service computing are analyzed,and based on the work of D Berardi and A Wombacher,a kind of finite state automata with condition cFSA(Finite State Automata with condition)is presented,and the service theory model based on cFSA is presented too.Based on this model,the formal theory model of service composition based on finite state automata with condition cFSA is studied.The algebraic property and implementing method of the service composition model are studied.

A Complexity Measure on Büchi Automata

Abstract: We define a complexity measure on non-deterministic B\(\ddot{\text {u}}\)chi automata, based on the notion of the width of the skeleton tree introduced by K\(\ddot{\text {a}}\)hler and Wilke. We show that the induced hierarchy tightly correlates to the Wagner Hierarchy, a corner stone in the theory of regular \(\omega \)-languages that is derived from a complexity measure on deterministic Muller automata. The relation between the hierarchies entails, for instance, that a nondeterministic B\(\ddot{\text {u}}\)chi automaton of width k can be translated to a deterministic parity automaton of degree at most \(2k+1\).