To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.

Two classes of finite Mealy automata (automata without branches, slowmoving automata) are considered in this article. We study algebraic properties of transformations defined by automata of these classes. We consider groups and semigroups defined by automata without branches.

The main contribution of this article is to investigate the application suitability of Cellular Automata based pseudo-random noise generator in Code Division Multiple Access Communications. New dynamics in group Cellular Automata were explored. Extensive analysis for two classes of group Cellular Automata (maximum length Cellular Automata and equal length Cellular Automata) were carried out. Th...

Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of quantum pushdown automata are not equiv...

Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...

We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellular automata are almost all intrinsically universal. We show however that intrinsic universality is undecidable for captive cellular automata. Finally, we show that almost all cellular automata have no non-trivial sub-automaton.

s of Talks Page I. Automata and Infinite Sequences 6 Ch. Frougny (Paris): Rational 0)-Relations, Application to the Representation of Real Numbers J. Karhuméiki (Turku): Finite Automata Computing Real Functions N. Klarlund (Aarhus): Progress Measures for Complementation of to-Automata B. Le Saec (Bordeaux): A Syntactic Approach to Deterministic to-Automata D. Perrin (Paris): to-Automata with Mu...

This thesis is focused on techniques for finite automata and their use in practice, with the main emphasis on nondeterministic tree automata. This concerns namely techniques for size reduction and language inclusion testing, which are two problems that are crucial for many applications of tree automata. For size reduction of tree automata, we adapt the simulation quotient technique that is well...