✦ LIBER ✦

On regularity of context-free languages

✍ Scribed by A. Ehrenfeucht; D. Haussler; G. Rozenberg

Publisher: Elsevier Science
Year: 1983
Weight: 112 KB
Volume: 1
Category: Article
ISSN: 0167-7136
DOI: 10.1016/0167-7136(83)90297-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On commutative context-free languages

✍ J. Beauquier; M. Blattner; M. Latteux 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 620 KB

A note on context-free languages

✍ R.F.C. Walters 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 296 KB

Efficient constructions of test sets for

Efficient constructions of test sets for regular and context-free languages

✍ Juhani Karhuma¨ki; Wojciech Rytter; Stefan Jarominek 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 799 KB

Approximately matching context-free lang

Approximately matching context-free languages

✍ Gene Myers 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 609 KB

Context-free languages and random walks

Context-free languages and random walks on groups

✍ Wolfgang Woess 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 435 KB

The Green function of an arbitrary, finitely supported random walk on a discrete group with context-free word problem is algebraic. It is shown how this theorem can be deduced from basic results of formal language theory. Context-free groups are precisely the finite extensions of free groups.