✦ LIBER ✦

On the finite degree of ambiguity of finite tree automata

✍ Scribed by Helmut Seidl

Publisher: Springer-Verlag
Year: 1989
Tongue: English
Weight: 756 KB
Volume: 26
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00263578

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On characteristic sets and degrees of fi

On characteristic sets and degrees of finite automata

✍ Keisuke Tanatsugu; Setsuo Arikawa 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 411 KB

The minimization of finite automata

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

On some classes of finite automata

✍ V.G. Lazarev; Ye.I. Piil 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 575 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

On the imbedding of asynchronous automat

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

✍ É. A. Vartapetov 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 164 KB

On path equivalence of nondeterministic

On path equivalence of nondeterministic finite automata

✍ Tzeng Wen-Guey 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 384 KB