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
05 Sep 2014
TL;DR: N nominal automata that accept infinite words are investigated and it is proved decidability of complement, union, intersection, emptiness and equivalence, and determinacy by ultimately periodic words are proved.
Abstract: Process calculi for service-oriented computing often feature generation of fresh resources. So-called nominal automata have been studied both as semantic models for such calculi, and as acceptors of languages of finite words over infinite alphabets. In this paper we investigate nominal automata that accept infinite words. These automata are a generalisation of deterministic Muller automata to the setting of nominal sets. We prove decidability of complement, union, intersection, emptiness and equivalence, and determinacy by ultimately periodic words. The key to obtain such results is to use finite representations of the (otherwise infinite-state) defined class of automata. The definition of such operations enables model checking of process calculi featuring infinite behaviours, and resource allocation, to be implemented using classical automata-theoretic methods.
2 citations
01 Dec 1996
TL;DR: The subset automaton construction is used and Klarlund's progress measure technique is applied to complement non-deterministic asynchronous cellular Buchi automata for infinite traces to yield a super-exponential blow-up in the size of local states sets.
Abstract: We present direct subset automata constructions for asynchronous (asynchronous cellular, resp.) automata. This provides a solution to the problem of direct determinization for automata with distributed control for languages of finite traces. We use the subset automaton construction and apply Klarlund's progress measure technique in order to complement non-deterministic asynchronous cellular Buchi automata for infinite traces. Both constructions yield a super-exponential blow-up in the size of local states sets.
2 citations
TL;DR: Periodicity and relaxation are investigated for the trajectories of the states in one-dimensional finite cellular automata with rules 90 and 150 and an eigenvalue analysis is applied to clarify the maximum value of period and relaxation.
Abstract: Periodicity and relaxation are investigated for the trajectories of the states in one-dimensional finite cellular automata with rules 90 and 150 [S. Wolfram, Rev. Mod. Phys. 55, 601 (1983)]. The time evolutions are described with matrices. An eigenvalue analysis is applied to clarify the maximum value of period and relaxation.
2 citations
Posted Content•
TL;DR: It is shown that all one-way quantum finite automaton (QFA) models that are at least as general as Kondacs-Watrous QFA's are equivalent in power to classical probabilistic finite automata in this setting.
Abstract: In this note, we generalize the results of arXiv:0901.2703v1 We show that all one-way quantum finite automaton (QFA) models that are at least as general as Kondacs-Watrous QFA's are equivalent in power to classical probabilistic finite automata in this setting. Unlike their probabilistic counterparts, allowing the tape head to stay put for some steps during its traversal of the input does enlarge the class of languages recognized by such QFA's with unbounded error. (Note that, the proof of Theorem 1 in the abstract was presented in the previous version (arXiv:0901.2703v1).)
2 citations
TL;DR: It is proved that deterministic and nondeterministic bottom-up automata accept the same class and it is proved also that nond deterministic top-down and bottom- up generalized automata have the same power.
2 citations