✦ LIBER ✦

A hierarchy of deterministic context-free ω-languages

✍ Scribed by J. Duparc

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 386 KB
Volume: 290
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00567-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hierarchy of deterministic languages

✍ Michael A. Harrison; Amiram Yehudai 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 957 KB

An hierarchy between context-free and co

An hierarchy between context-free and context-sensitive languages

✍ Takumi Kasai 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 718 KB

Infinite subfamilies ~l, ~ .... , -oq'~o, .W,~ of the family consisting of contextsensitive languages, are introduced such that .2'~ ~z~ ..-C ~| ~o,where 9 LP a is the family of e-free context-free languages, Ld,o is the family of context-sensitive languages, and each L/', is an Abstract Family of L

Borel hierarchy and omega context free l

Borel hierarchy and omega context free languages

✍ Olivier Finkel 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 214 KB

We give in this paper additional answers to questions of Lescow and Thomas (A decade of

A pumping lemma for real-time determinis

A pumping lemma for real-time deterministic context-free languages

✍ Yoshihide Igarashi 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 569 KB

A graph-based regularity test for determ

A graph-based regularity test for deterministic context-free languages

✍ Priti Shankar; B.S. Adiga 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 550 KB

Bracketed context-free languages

✍ Seymour Ginsburg; Michael A. Harrison 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 1012 KB

A bracketed grammar is a context-free grammar in which indexed brackets are inserted around the right-hand sides of the rules. The language generated by a bracketed grammar is a bracketed language. An algebraic condition is given for one bracketed language to be a subset of another. The intersection