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
30 Jun 1998
TL;DR: The paper identifies three subset construction algorithms which treat e-moves and suggests that the average number of e-Moves per state can be used to predict which algorithm is likely to perform best for a given input automaton.
Abstract: The paper discusses the problem of determinising finite-state automata containing large numbers of e-moves. Experiments with finite-state approximations of natural language grammars often give rise to very large automata with a very large number of e-moves. The paper identifies three subset construction algorithms which treat e-moves. A number of experiments has been performed which indicate that the algorithms differ considerably in practice. Furthermore, the experiments suggest that the average number of e-moves per state can be used to predict which algorithm is likely to perform best for a given input automaton.
12 citations
01 Jan 2013
TL;DR: It is shown that every multilinear word can be written in a form which is amenable to parsing, and that there exist infinite words determined by 1:multi-DFA which are not multil inear.
Abstract: We characterize the infinite words determined by one-way stack automata. An infinite language L determines an infinite word alpha if every string in L is a prefix of alpha. If L is regular or context-free, it is known that alpha must be ultimately periodic. We extend this result to the class of languages recognized by one-way nondeterministic checking stack automata (1-NCSA). We then consider stronger classes of stack automata and show that they determine a class of infinite words which we call multilinear. We show that every multilinear word can be written in a form which is amenable to parsing. Finally, we consider the class of one-way multihead deterministic finite automata (1:multi-DFA). We show that every multilinear word can be determined by some 1:multi-DFA, but that there exist infinite words determined by 1:multi-DFA which are not multilinear.
12 citations
TL;DR: The source of a set of states of an automaton is introduced as the set of all predecessors of members of the set to be a valuable tool in proofs and to provide new insights and directions in automata theory.
Abstract: The source of a set of states of an automaton is introduced as the set of all predecessors of members of the set. The source is shown to be a valuable tool in proofs; it is also shown to provide new insights and directions in automata theory. Relationships are explored between the source on the one hand and, on the other, subautomata, primaries, blocks, connectivity, separation, strong connectedness, retrievability, Abelian automata, homomorphisms, and other concepts.
12 citations
TL;DR: This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA.
Abstract: The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA. This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1. We also introduce a generalization of the rtQ1CA, the quantum one-way one-counter automaton (1Q1CA), and show that they too are superior to the corresponding family of probabilistic machines. For this purpose, we provide general definitions of these models that reflect the modern approach to the definition of quantum finite automata, and point out some problems with previous results. We identify several remaining open problems.
12 citations
TL;DR: This paper proposes another method to obtain a @l-free automaton from a regular expression, whose number of states is bounded above by the size of both the partial derivatives automaton and of the follow automaton.
12 citations