Substitution and bounded languages

Authors:
Jonathan Goldstine
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1972

Citing 5
Cited 5

An Infinite Hierarchy of Context-Free Languages

Journal of the ACM (JACM)
Checking automata and one-way stack languages

Journal of Computer and System Sciences
Principal AFL

Journal of Computer and System Sciences
What makes some language theory problems undecidable

Journal of Computer and System Sciences
Syntactic operators on full semiAFLs

Journal of Computer and System Sciences

A Parallel Context-Free Derivation Hierarchy

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Some independent families of one-letter languages

Journal of Computer and System Sciences
Proving containment of bounded AFL

Journal of Computer and System Sciences
Bounded AFLs

Journal of Computer and System Sciences
There does not exist a minimal full trio with respect to bounded context-free languages

DLT'11 Proceedings of the 15th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A full AFL is defined to be full-bounded if it can be generated by a set of boundedlanguages. It is shown that if @? is an AFL not consisting entirely of regular sets and if @? is contained in any full-bounded AFL, then @? is not closed under e-free substitution. Some typical consequences are that some context-free languages cannot be generated from any set of (not necessarily context-free) bounded languages by full AFL operations, or from any set of bounded context-free languages by full AFL operations and substitution.