𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A subclass of deterministic context-free languages with a decidable inclusion problem

✍ Scribed by P. V. Gorshkov; A. B. Stavrovskii

Publisher
Springer US
Year
1990
Tongue
English
Weight
693 KB
Volume
26
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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