✦ LIBER ✦

Closure properties of deterministic indexed languages

✍ Scribed by R. Parchmann; J. Duske; J. Specht

Book ID: 114037519
Publisher: Elsevier Science
Year: 1980
Weight: 787 KB
Volume: 46
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(80)90766-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On deterministic indexed languages

✍ R. Parchmann; J. Duske; J. Specht 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 884 KB

Regular Closure of Deterministic Languag

Regular Closure of Deterministic Languages

✍ Bertsch, Eberhard; Nederhof, Mark-Jan 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 437 KB

A closure property of deterministic cont

A closure property of deterministic context-free languages

✍ C. Choffrut 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 618 KB

Closure properties of slender languages

✍ Gheorghe Paŭn; Arto Salomaa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 576 KB

Closure properties of locally finite ω-l

Closure properties of locally finite ω-languages

✍ Olivier Finkel 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 270 KB

A gap property of deterministic tree lan

A gap property of deterministic tree languages

✍ Damian Niwiński; Igor Walukiewicz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 277 KB

We show that a tree language recognized by a deterministic parity automaton is either hard for the co-B uchi level and therefore cannot be recognized by a weak alternating automaton, or is on a very low level in the hierarchy of weak alternating automata. A topological counterpart of this property i