A closure property of deterministic context-free languages
- 1 February 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 12 (1) , 13-16
- https://doi.org/10.1016/0020-0190(81)90067-3
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Test sets and checking words for homomorphism equivalenceJournal of Computer and System Sciences, 1980
- A representation of trees by languages ITheoretical Computer Science, 1978
- Sur une variante des fonctions sequentiellesTheoretical Computer Science, 1977
- A note on pushdown store automata and regular systemsProceedings of the American Mathematical Society, 1967