✦ LIBER ✦

The equivalence problem for deterministic TOL-systems is undecidable

✍ Scribed by G. Rozenberg

Book ID: 113161684
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 83 KB
Volume: 1
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(72)90022-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The equivalence problem for deterministi

The equivalence problem for deterministic T0L-systems is undecidable

✍ Grzegorg Rozenberg 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 437 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

The equivalence problem for deterministi

The equivalence problem for deterministic finite-turn pushdown automata

✍ Leslie G. Valiant 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 500 KB

The Subtyping Problem for Second-Order T

The Subtyping Problem for Second-Order Types Is Undecidable

✍ Jerzy Tiuryn; Paweł Urzyczyn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 154 KB

Direct proofs of the undecidability of t

Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems

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