论文信息 - Substitution and Bounded Languages

Substitution and Bounded Languages

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.

Jonathan Goldstine | Jonathan Goldstine

[1] Sheila A. Greibach,et al. Syntactic Operators on Full SemiAFLs , 1972, J. Comput. Syst. Sci..

[2] S. Ginsburg,et al. Bounded -like languages , 1964 .

[3] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.

[4] Sheila A. Greibach,et al. Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..

[5] Seymour Ginsburg,et al. BOUNDED REGULAR SETS , 1966 .

[6] Juris Hartmanis,et al. What makes Some Language Theory Problems Undecidable , 1970, J. Comput. Syst. Sci..

[7] Seymour Ginsburg,et al. Studies In Abstract Families Of Languages , 1969 .

[8] S. Ginsburg,et al. BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[9] S. Ginsburg,et al. Finite-Turn Pushdown Automata , 1966 .

[10] Seymour Ginsburg,et al. Principal AFL , 1970, J. Comput. Syst. Sci..

[11] Sheila A. Greibach,et al. An Infinite Hierarchy of Context-Free Languages , 1969, JACM.