✦ LIBER ✦

On the imbedding of asynchronous automata into a product of finite automata

✍ Scribed by É. A. Vartapetov

Publisher: Springer US
Year: 1973
Tongue: English
Weight: 164 KB
Volume: 6
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01073963

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimization of finite automata

✍ A. A. Letichevskii 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 268 KB

On the finite degree of ambiguity of fin

On the finite degree of ambiguity of finite tree automata

✍ Helmut Seidl 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 756 KB

On the Computational Complexity of Finit

On the Computational Complexity of Finite Cellular Automata

✍ K. Sutner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N

Asymptotic estimates of the number of fi

Asymptotic estimates of the number of finite automata

✍ A. D. Korshunov 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 386 KB

On the statistical properties of transfo

On the statistical properties of transformations realizabie on finite automata

✍ V. M. Sidel'nikov 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 946 KB

On the Hurwitz product of formal power s

On the Hurwitz product of formal power series and automata

✍ Gerhard Küster 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 799 KB