✦ LIBER ✦

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

✍ Scribed by Gurari, Eitan M.

Book ID: 118174087
Publisher: Society for Industrial and Applied Mathematics
Year: 1982
Tongue: English
Weight: 564 KB
Volume: 11
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0211035

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The decidability of equivalence for dete

The decidability of equivalence for deterministic finite transducers

✍ Meera Blattner; Tom Head 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 294 KB

On the decidability of equivalence for d

On the decidability of equivalence for deterministic pushdown transducers

✍ Oscar H. Ibarra; Louis E. Rosier 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 637 KB

On the containment and equivalence probl

On the containment and equivalence problems for two-way transducers

✍ Oscar H. Ibarra; Hsu-Chun Yen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 271 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 TOL-systems is undecidable

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

On the Decidability of the Equivalence P

On the Decidability of the Equivalence Problem for Orthogonal Sequential Programs

✍ Vladimir A. Zakharov 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 102 KB