✦ LIBER ✦

On the equivalence and containment problems for context-free languages

✍ Scribed by J. E. Hopcroft

Publisher: Springer
Year: 1969
Tongue: English
Weight: 407 KB
Volume: 3
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01746517

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the equivalence problem of compositio

On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages

✍ Yael Maon 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Some algorithmic problems for groups and

Some algorithmic problems for groups and context-free languages

✍ A. V. Anisimov 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 861 KB

The inclusion problem for some subclasse

The inclusion problem for some subclasses of context-free languages

✍ Peter R.J. Asveld; Anton Nijholt 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 131 KB

By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the inclusion problem for unambiguous context-free grammars is undecidable. The argument or some straightforward modiÿcation also applies to some other subclasses of context-free languages such as linear

On the relation between the class of all

On the relation between the class of all context-free languages and the class of deterministic context-free languages

✍ A. Ya. Dikovskii 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 777 KB

A context-free language and enumeration

A context-free language and enumeration problems on infinite trees and digraphs

✍ W. Kuich 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 229 KB

On the Chomsky and Stanley's homomorphic

On the Chomsky and Stanley's homomorphic characterization of context-free languages

✍ Sadaki Hirose; Masaaki Yoneda 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 172 KB