ω-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.

Some properties of the basis finite automaton

Abstract: The present paper discusses non-deterministic finite Rabin-Scott's automata. The majority of works recently dealing with this subject were, in fact, concerned only with properties of a canonical form automata or of some objects equivalent to it. This article continues the series of works in which the authors state a different point of view, describing the finite automata as just another invariant of the given regular language called basis finite automaton. In this article the authors argue on some new properties for the basis finite automaton. One of them is included into basis automaton's table of binary relations. It is stated that this table can not contain either identical strings or identical columns. Another property depicts a possibility to obtain any finite automaton for a given regular language by the process of duplicating or combining some of its states.

Generalized automata and their information losslessness

Abstract: A generalized model of automata is defined in which the outputs are sequences of letters (rather than single letters) for each input letter. The output sequences are transmitted without spacing, just as in the case of variable length codes. The paper describes a test for determining whether a given generalized automaton is information lossless, and if so, whether information lossless of finite order. (Decipherable with finite delay.) The codes generated by generalized automata are believed to be even harder to break than ordinary variable length codes. The techniques described in the present paper provide useful tools in the design of such coding procedures.

Lower Bounds for Generalized Quantum Finite Automata

Abstract: We obtain several lower bounds on the language recognition power of Nayak's generalized quantum finite automata (GQFA)[12]. Techniques for proving lower bounds on Kondacs and Watrous' one-way quantum finite automata (KWQFA)were introduced by Ambainis and Freivalds [2], and were expanded in a series of papers. We show that many of these techniques can be adapted to prove lower bounds for GQFAs. Our results imply that the class of languages recognized by GQFAs is not closed under union. Furthermore, we show that there are languages which can be recognized by GQFAs with probability p> 1/2, but not with p> 2/3.

A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata.

Abstract: We propose a generic method for deciding semantic equivalences between pushdown automata and finite-state automata. The abstract part of the method is applicable to every process equivalence which is a right PDA congruence. Practical usability of the method is demonstrated on selected equivalences which are conceptual representatives of the whole spectrum. In particular, special attention is devoted to bisimulation-like equivalences (including weak, early, delay, branching, and probabilistic bisimilarity), and it is also shown how the method applies to simulation-like and trace-like equivalences. The generality does not lead to the loss of efficiency; the algorithms obtained by applying our method are essentially time-optimal and sometimes even polynomial. The list of particular results obtained by our method includes items which are first of their kind.