A remark about a substitution property
- 24 Downloads
S. A. Greibach proved in “Chains of full AFL's” a useful property concerning the substitution of full semi-AFL's. We prove here that this property remains true when the families of languages under considerations are assumed only to be full trios, i.e., closure under union is not required.
KeywordsComputational Mathematic Substitution Property
Unable to display preview. Download preview PDF.
- 1.J. Berstel. (1979) Transductions and context free languages, Teubner Verlag (1979).Google Scholar
- 2.S. Ginsburg. Algebraic and automata-theoretic properties of formal languages. North Holland Publishing Company, (1975).Google Scholar
- 3.S. A. Greibach. Chains of full AFLs,Mathematical Systems Theory 4, 231–242 (1970).Google Scholar