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
26 May 2011
TL;DR: Results of the study of their parameterized complexity allows us to find new bounds of their non-polynomial time algorithmic behaviors for classicalTree automata, rigid tree automata (RTA), tree automATA with global equality and disequality (TAGED) and t-DAG automata.
Abstract: here are many decision problems in automata theory (including membership, emptiness, emptiness of intersection, inclusion and universality problems) that for some classes of tree automata are NPhard. The study of their parameterized complexity allows us to find new bounds of their non-polynomial time algorithmic behaviors. We present results of such a study for classical tree automata (TA), rigid tree automata (RTA), tree automata with global equality and disequality (TAGED) and t-DAG automata.
3 citations
Journal Article•
TL;DR: In this paper, the authors presented an algorithm for deterministic finite automata with time complexity O(n 2 log n) where n is the number of states in the automaton.
Abstract: In this paper we introduce a new idea, which can be used in minimization of a deterministic finite automaton. Namely, we associate names with states of an automaton and we sort them. We give a new algorithm, its correctness proof, and its proof of execution time bound. This algorithm has time complexity O(n 2 log n) and can be considered as a direct improvement of Wood's algorithm [6] which has time complexity O(n 3 ), where n is the number of states. Wood's algorithm checks if pairs of states are distinguishable. It is improved by making better use of transitivity. Similarly some other algorithms which check if pairs of states are distinguishable can be improved using sorting procedures.
3 citations
16 May 2012
TL;DR: Finite automata with random bits written on a separate 2-way readable tape can recognize languages not recognizable by probabilistic finite automata.
Abstract: Finite automata with random bits written on a separate 2-way readable tape can recognize languages not recognizable by probabilistic finite automata. This shows that repeated reading of random bits by finite automata can have big advantages over one-time reading of random bits.
3 citations
TL;DR: It is shown that the endomorphism monoid E([email protected]?B) of automaton [email-protected?]B is a Clifford monoid, which generalizes and extends the representations of strongly connected automata given by Ito (1976).
3 citations
TL;DR: An estimate of the dimension of stability of automata that are not necessarily minimal state is based on this result for minimal-state automata, and the upper bound on thedimension of stability is given.
Abstract: The concept of the dimension of stability of stochastic automata is introduced and examined. We are concerned with the minimal-state form of the automaton and the dimension of stability. Natural automata are defined, for which the dimension of stability is not less than the difference between the number of states and the number of states of its minimal-state equivalent. For minimal state automata, the upper bound on the dimension of stability is given, and we demonstrate minimal-state automata for which the dimension of stability reaches this upper bound. An estimate of the dimension of stability of automata that are not necessarily minimal state is based on this result for minimal-state automata.
3 citations