✦ LIBER ✦

Dm-automata and classes of context-free languages

✍ Scribed by A. B. Stavrovskii; O. Yu. Pavliv

Publisher: Springer US
Year: 1993
Tongue: English
Weight: 520 KB
Volume: 29
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01130084

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on context free languages, comple

A note on context free languages, complexity classes, and diagonalization

✍ F. D. Lewis 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 311 KB

Classes of regular and context-free lang

Classes of regular and context-free languages over countably infinite alphabets

✍ Friedrich Otto 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 747 KB

Syntactic analysis of context-free (CF)

Syntactic analysis of context-free (CF) languages using nondeterministic push-down automata

✍ A. Sh. Nepomnyashchaya 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 764 KB

A note on multihead automata and context

A note on multihead automata and context-sensitive languages

✍ Walter J. Savitch 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 English ⚖ 204 KB

Context-free languages and rudimentary a

Context-free languages and rudimentary attributes

✍ Neil D. Jones 📂 Article 📅 1969 🏛 Springer 🌐 English ⚖ 469 KB

Alternating finite automata and star-fre

Alternating finite automata and star-free languages

✍ Kai Salomaa; Sheng Yu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 96 KB

For a given extended regular expression e we construct an equational representation of an alternating ÿnite automaton accepting the language denoted by e. For star-free extended regular expressions the construction yields a loop-free alternating ÿnite automaton. Also the inclusion in the opposite di