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
16 Nov 2015
TL;DR: It is proved that deciding simulation preorder for parametrized automata is EXPTIME-complete, extending an earlier result showing it inEXPTIME.
Abstract: We compare parametrized automata, a class of automata recently introduced by the authors, against finite memory automata with non-deterministic assignment, an existing class of automata used to model services. We prove that both classes have the same expressive power, while parametrized automata can be exponentially succinct in some cases. We then prove that deciding simulation preorder for parametrized automata is EXPTIME-complete, extending an earlier result showing it in EXPTIME.
TL;DR: By analysis of the ranges and domain partitions of input functions of an automaton, regularity on the structure of the semigroup automaton is established and significant improvement is made to decision algorithms for the semigroups of automata.
Posted Content•
TL;DR: In this article, it was shown that a group is locally finite if and only if every real (or complex) linear cellular automaton with finite-dimensional alphabet over the group is injective.
Abstract: We prove that a group $G$ is locally finite if and only if every surjective real (or complex) linear cellular automaton with finite-dimensional alphabet over $G$ is injective.
01 Dec 1987
TL;DR: The equivalence problem for 2-tape deterministic finite automata was shown decidable by Bird in 1973, and it is shown that it is decidable for the restricted class of simple automata.
Abstract: The equivalence problem for 2-tape deterministic finite automata was shown decidable by Bird in 1973, for n-tapes the problem is still open. We show that it is decidable for the restricted class of simple automata. An n-tape deterministic finite automaton is simple if at most one cycle goes through each of its states.
01 Jul 2017
TL;DR: A new variant of the Antimirov's partial derivatives for the conversion of fuzzy regular expressions to ε-free fuzzy non-deterministic finite automata that is an improvement over the existing approaches because it is ε -free.
Abstract: Antimirov's partial derivatives are used in classical automata theory for the conversion of regular expressions to finite automata, tree regular expressions to tree automata, and ω-regular expressions to Buchi automata. In this paper, we describe a new variant of the Antimirov's partial derivatives for the conversion of fuzzy regular expressions to e-free fuzzy non-deterministic finite automata. The membership values in fuzzy automata are assigned by using integral lattice-ordered monoids. The resulting automaton turns out to be an improvement over the existing approaches, because it is e -free. Furthermore, herein it is formally proved that a non-deterministic fuzzy automaton M is obtained from a fuzzy regular expression r such that LR(M) LR(r).