Bounded AFLs
- 1 June 1976
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 12 (3) , 399-419
- https://doi.org/10.1016/s0022-0000(76)80010-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Some independent families of one-letter languagesJournal of Computer and System Sciences, 1975
- Intersection-closed full AFL and the recursively enumerable languagesInformation and Control, 1973
- Multitape AFAJournal of the ACM, 1972
- Substitution and bounded languagesJournal of Computer and System Sciences, 1972
- Three theorems concerning principal AFLsJournal of Computer and System Sciences, 1971
- 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
- Unending chess, symbolic dynamics and a problem in semigroupsDuke Mathematical Journal, 1944