✦ LIBER ✦

The equivalence problem for deterministic T0L-systems is undecidable

✍ Scribed by Grzegorg Rozenberg

Book ID: 113161691
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 437 KB
Volume: 1
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(72)90039-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The equivalence problem for deterministi

The equivalence problem for deterministic TOL-systems is undecidable

✍ G. Rozenberg 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 83 KB

The sequence equivalence problem for pri

The sequence equivalence problem for primitive D0L systems

✍ Juha Honkala 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 172 KB

The language equivalence problem for HD0

The language equivalence problem for HD0L systems having D0L growths

✍ Juha Honkala 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 190 KB

The Equivalence Problem for Deterministi

The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable

✍ Gurari, Eitan M. 📂 Article 📅 1982 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 564 KB

The equivalence problem for deterministi

The equivalence problem for deterministic two-tape automata

✍ Malcolm Bird 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 715 KB

A decision procedure is described for equivalence of deterministic two-tape (oneway) automata. ## l. INTRODUCTION The notion of an n-tape (one-way, deterministic) automaton was introduced by Rabin and Scott [2]. Although the properties of these devices have been studied extensively, no answer has

Bounds for the D0L language equivalence

Bounds for the D0L language equivalence problem

✍ Juha Honkala 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 188 KB