Le cylindre des langages linéaires
- 1 December 1977
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 11 (1) , 147-155
- https://doi.org/10.1007/bf01768473
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Uniformly erasable AFLJournal of Computer and System Sciences, 1975
- Jump PDA’s and Hierarchies of Deterministic Context-Free LanguagesSIAM Journal on Computing, 1974
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- A helpful result for proving inherent ambiguityTheory of Computing Systems, 1968
- Ambiguity in context free languagesJournal of the ACM, 1966