Context-free programmed grammars and ETOL systems
The relationship between ETOL systems and context-free programmed grammars is investigated. The characterization of the class of ETOL languages, and its main subclasses (EOL, EDTOL, EDOL) in terms of various subclasses of the class of context-free programmed grammars is provided. Then an extension of the notion of an ETOL system is investigated. In this way a characterization of the class of context-free programmed languages is provided.
KeywordsFormal Language Regular Language Context Free Grammar Type Star Chain Event
Unable to display preview. Download preview PDF.
- A.Ehrenfeucht, G.Rozenberg and S.Skuym, A relationship between ETOL and EDTOL languages, to appear in Theoretical Computer Science.Google Scholar
- G.T.Herman and G.Rozenberg, Developmental systems and Languages, North Holland Publ. Comp. 1975.Google Scholar
- D. Rosenkrantz, Programmed grammars and classes of formal languages, J.Assoc. Comput. Mach., 16,107–131,1969.Google Scholar
- G.Rozenberg, A.Salomaa (eds.), L systems, Springer Verlag, 1974.Google Scholar
- G.Rozenberg, A.Salomaa, Mathematical theory of L systems, to appear in Progress in Information Processing, J.Ton (ed.).Google Scholar
- A.Salomaa, Formal Languages, Academic Press, 1975.Google Scholar
- A.Salomaa, Parallelism in rewriting systems, Lecture Notes in Computer Science No. 14, 523–533, Springer Verlag, 1974.Google Scholar
- S.Skyum, On decomposing languages defined by parallel devices, to appear in SIAM Journal on Computing.Google Scholar
- J.van Leeuwen, The membership question for ETOL languages is polynomially complete, Inf. Proceeding Letters, 3,138–143.Google Scholar