Substitution and bounded languages
- 29 February 1972
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 6 (1) , 9-29
- https://doi.org/10.1016/s0022-0000(72)80038-2
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- What makes some language theory problems undecidableJournal of Computer and System Sciences, 1970
- Principal AFLJournal of Computer and System Sciences, 1970
- Chains of full AFL'sTheory of Computing Systems, 1970
- Checking automata and one-way stack languagesJournal of Computer and System Sciences, 1969
- An Infinite Hierarchy of Context-Free LanguagesJournal of the ACM, 1969
- Bounded regular setsProceedings of the American Mathematical Society, 1966
- Finite-Turn Pushdown AutomataSIAM Journal on Control, 1966