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: This work defines a model of advised computation by finite automata where the advice is provided on a separate tape, and proves several separation results among variants, and demonstrates an infinite hierarchy of language classes recognized by automata with increasing advice lengths.
Abstract: We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, demonstrate an infinite hierarchy of language classes recognized by automata with increasing advice lengths, and establish the relationships between this and the previously studied ways of providing advice to finite automata.
8 citations
••
03 Jul 2007TL;DR: In this paper, the authors introduce linear expressions for unrestricted dags (directed acyclic graphs) and finite deterministic and non-deterministic automata operating on them, which are a conservative extension of the Tu,u-automata of Courcelle on unranked, unordered trees and forests.
Abstract: We introduce linear expressions for unrestricted dags (directed acyclic graphs) and finite deterministic and nondeterministic automata operating on them. Those dag automata are a conservative extension of the Tu,u-automata of Courcelle on unranked, unordered trees and forests. Several examples of dag languages acceptable and not acceptable by dag automata and some closure properties are given.
8 citations
••
TL;DR: A new model of one-way reversible finite automata inspired by the Watson–Crick complementarity relation is introduced and it is shown that the model can accept all regular languages.
Abstract: Since 1970, reversible finite automata have generated interest among researcher; but till now, we have not come across a model of reversible read only one-way finite automata which accept all regular languages, In this paper, we introduce a new model of one-way reversible finite automata inspired by the Watson---Crick complementarity relation and show that our model can accept all regular languages. We further show that our model accepts a language which is not accepted by any multi-head deterministic finite automaton.
8 citations
••
19 Apr 2016
TL;DR: Basic models, approaches, techniques and results in this promising area of quantum automata that is expected to play an important role also in theoretical computer science are overviewed.
Abstract: Various quantum versions o f the most basic models o f the classical finite automata have already been introduced and various modes of their computations have already started t o be investigated. In this paper we overview basic models, approaches, techniques and results in this promising area of quantum automata that is expected to play an important role also in theoretical computer science. We also summarize some open problems and research directions to pursue in this area.
8 citations
•
TL;DR: This paper proves theorems describing the space, time, and state-set complexity of the simulation of d-dimensional conventional cellular automata with N-body automata, and shows that there exist computation-universal 2- body automata requiring 5.81 bits of state per cell.
Abstract: Few-body automata are a class of cellular automata. They were developed specifically to investigate the possibility of implementing a new generation of cellular automata machines that would use dense arrays of nanometer-scale device-cells. In this paper, we try to determine how many states per cell are required by few-body automata in order to perform universal computation. We prove theorems describing the space, time, and state-set complexity of the simulation of d-dimensional conventional cellular automata with N-body automata, and show that there exist computation-universal 2-body automata requiring 5.81 bits of state per cell for d = 1 and 2 bits per cell for d = 2. These results suggest that physically-imposed restrictions on the number of available bits per cell will not be an obstacle to cellular automaton-like computation at nanometer scales.
8 citations