✦ LIBER ✦

Two decidability results for deterministic pushdown automata

✍ Scribed by Matti Linna

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 1013 KB
Volume: 18
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90055-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Synchronizable deterministic pushdown au

Synchronizable deterministic pushdown automata and the decidability of their equivalence

✍ Karel Culik; Juhani Karhumäki 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 507 KB

Notes on looping deterministic two-way p

Notes on looping deterministic two-way pushdown automata

✍ M. Ladermann; H. Petersen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 444 KB

A simulation result for the auxiliary pu

A simulation result for the auxiliary pushdown automata

✍ Tero Harju 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 771 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