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: It is shown that some kind of meaningful computation can be embedded in very simple, microscopically homogeneous, one-dimensional automata, and in particular filter automata with a parity next-state rule.
Abstract: It is shown that some kind of meaningful computation can be embedded in very simple, microscopically homogeneous, one-dimensional automata, and in particular filter automata with a parity next-state rule. A systematic procedure is given for generating moving, periodic structures (particles). These particles exhibit soliton-like properties; that is, they often pass through one another with phase shifts. Ways to encode information in the phase of these particles are discussed. The search for useful logical operations is reduced to a search for paths in certain graphs. As a demonstration of principle, the details of implementing a carry-ripple adder are given. >
68 citations
••
08 Jul 2002TL;DR: A new one-dimensional universal automaton with von Neumann neighborhood and only 6 states is constructed, thus improving the best known lower bound both for computational and intrinsic universality.
Abstract: We formalize the idea of intrinsically universal cellular automata, which is strictly stronger than classical computational universality. Thanks to this uniform notion, we construct a new one-dimensional universal automaton with von Neumann neighborhood and only 6 states, thus improving the best known lower bound both for computational and intrinsic universality.
66 citations
••
01 May 1999TL;DR: It is shown that the most fundamental decision question, the emptiness problem, is not solvable for this model of a 1.5.way quantum finite automaton.
Abstract: Our model in this paper is a 1.5.way quantum finite automaton which can move its head 0 or +1 position but not -1 position. It is shown that the most fundamental decision question, the emptiness problem, is not solvable for this model. Note that the emptiness problem is solvable far push-down automata and even for one-way nondeterministic stack automata.
66 citations
•
TL;DR: This work gives asymptotic estimates and some explicit computations for both the number of distinct languages and theNumber of distinct finite languages over a k-letter alphabet that are accepted by deterministic finite automata with n states.
Abstract: We give asymptotic estimates and some explicit computations for both the number of distinct languages and the number of distinct finite languages over a k-letter alphabet that are accepted by deterministic finite automata (resp. nondeterministic finite automata) with n states.
65 citations
••
01 Mar 1999TL;DR: JFLAP is enhanced to allow one to study the proofs of several theorems that focus on conversions of languages, from one form to another, such as converting an NFA to a DFA and then to a minimum state DFA.
Abstract: An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback in CPS 140, our automata theory course. JFLAP is a tool for designing and running nondeterministic versions of finite automata, pushdown automata, and Turing machines. Recently, we have enhanced JFLAP to allow one to study the proofs of several theorems that focus on conversions of languages, from one form to another, such as converting an NFA to a DFA and then to a minimum state DFA. In addition, our enhancements combined with other tools allow one to interactively study LL and LR parsing methods.
65 citations