✦ LIBER ✦

On ω-sets associated with context-free languages

✍ Scribed by M. Linna

Book ID: 118530907
Publisher: Elsevier Science
Year: 1976
Weight: 845 KB
Volume: 31
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(76)90415-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Remark on Code Sets and Context-Free L

A Remark on Code Sets and Context-Free Languages

✍ Greibach, S.A. 📂 Article 📅 1975 🏛 IEEE 🌐 English ⚖ 452 KB

Test sets for homomorphism equivalence o

Test sets for homomorphism equivalence on context free languages

✍ J. Albert; K. Culik II 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 537 KB

A hierarchy of deterministic context-fre

A hierarchy of deterministic context-free ω-languages

✍ J. Duparc 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 386 KB

Polynomial Size Test Sets For Context-Fr

Polynomial Size Test Sets For Context-Free Languages

✍ J. Karhumaki; W. Plandowski; W. Rytter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 648 KB

We prove that each context-free language possesses a test set of size \(O\left(m^{6}\right)\), where \(m\) is the number of productions in a grammar-producing the language. A context-free grammar generating the test set can be found in polynomial time by a sequential algorithm. It improves the doubl

On commutative context-free languages

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

On omega context free languages which ar

On omega context free languages which are Borel sets of infinite rank

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

This paper is a continuation of the study of topological properties of omega context free languages (!-CFL). We proved in (Topological properties of omega context free languages, Theoretical Computer Science, 262 (1-2) (2001) 669-697) that the class of !-CFL exhausts the ÿnite ranks of the Borel hie