Proving containment of bounded AFL
- 1 August 1975
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 11 (1) , 1-55
- https://doi.org/10.1016/s0022-0000(75)80048-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Multi-stack-counter languagesTheory of Computing Systems, 1972
- Substitution and bounded languagesJournal of Computer and System Sciences, 1972
- Syntactic operators on full semiAFLsJournal of Computer and System Sciences, 1972
- Images of AFL under certain families of homomorphismsTheory of Computing Systems, 1971
- Three theorems concerning principal AFLsJournal of Computer and System Sciences, 1971
- Characteristic and ultrarealtime languagesInformation and Control, 1971
- Principal AFLJournal of Computer and System Sciences, 1970
- Checking automata and one-way stack languagesJournal of Computer and System Sciences, 1969
- On Context-Free LanguagesJournal of the ACM, 1966
- Bounded regular setsProceedings of the American Mathematical Society, 1966