✦ LIBER ✦

Notes on looping deterministic two-way pushdown automata

✍ Scribed by M. Ladermann; H. Petersen

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 444 KB
Volume: 49
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)90088-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two decidability results for determinist

Two decidability results for deterministic pushdown automata

✍ Matti Linna 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

Yield-languages of two-way pushdown tree

Yield-languages of two-way pushdown tree automata

✍ Kai Salomaa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 476 KB

One-way multihead deterministic finite a

One-way multihead deterministic finite automata

✍ J. Hromkovič 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 392 KB

On two-way tree automata

✍ Etsuro Moriya 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 323 KB

On two-way multihead automata

✍ Oscar H. Ibarra 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 479 KB

For each positive integer n, let -~eN(n ) be the class of sets accepted by a family of automata of type N, each with a read-only input with endmarkers and n two-way input heads. The following result, which is applicable to most types of two-way multihead devices, is proved: If for each positive inte

One-way globally deterministic synchroni

One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages

✍ Anna Slobodová 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 400 KB