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
TL;DR: Borders of the length of the shortest reaching words for automata with a fixed number of states are obtained for nondeterministic automata over 2-letter, 3-letter and arbitrary alphabets.
Abstract: We study subset reachability in nondeterministic finite automata and look for bounds of the length of the shortest reaching words for automata with a fixed number of states. We obtain such bounds for nondeterministic automata over 2-letter, 3-letter and arbitrary alphabets.a
1 citations
01 Sep 2005
TL;DR: Why the second finite state approach to Optimality Theory fails for most linguistically interesting cases is reviewed, and how this approach could be used in the future as a—hopefully cognitively adequate—model of the mental lexicon is presented.
Abstract: Finite State approaches to Optimality Theory have had two goals. The earlier and less ambitious one was to compute the optimal output by compiling a finite state automaton for each underlying representation. Newer approaches aimed at realizing the OT-systems as FS transducers mapping any underlying representation to the corresponding surface form. After reviewing why the second one fails for most linguistically interesting cases, we use its ideas to accomplish the first goal. Finally, we present how this approach could be used in the future as a—hopefully cognitively adequate—model of the mental lexicon.
1 citations
23 Jul 2001
TL;DR: In this paper, a simple generalization of the transition tables of nondeterministic finite automata leads to a hierarchy of succinct non-deterministic descriptions for automata, and it is shown that the hierarchy corresponds to deterministic automata on level 0 by default, and to alternating (boolean) finite (i.e., non-terminating) automata at level 1 by default.
Abstract: We show that a simple generalization of the transition tables of nondeterministic finite automata leads to a hierarchy of succinct nondeterministic descriptions for finite automata. We show that the hierarchy corresponds to deterministic finite automata on level 0 and nondeterministic finite automata on level 1 by default, and prove that the hierarchy corresponds to alternating (boolean) finite automata on level 2. We show that there exists an n-state level 3 finite automaton M such that its equivalent minimal deterministic finite automaton M? has more that 22n states.
1 citations
06 Sep 2011
TL;DR: A class of infinite automata, in which all local computations are performed by finite state machines, which characterize an abstract family of languages which does not seem to coincide with any other known class, and which seems to cut across the Chomsky hierarchy.
Abstract: We present a class of infinite automata, in which all local computations are performed by finite state machines. These automata characterize an abstract family of languages which does not seem to coincide with any other known class, and which seems to cut across the Chomsky hierarchy. We show results regarding recognizing power and closure properties, and sketch the use of machine growth as a refined measure of complexity with respect to some well-known measures.
1 citations