Substitutions dans le EDTOL Systèmes Ultralinéaires

en We study EDT0L-systems with terminal alphabet in which all words derivated from the axiom countain a bounded number of occurrences of non-terminals. We define, also, unary operators associated with these systems.

[1]  Max Dauchet,et al.  Transductions de Forets Reconnaissables Monadiques Forets Coregulieres , 1976, RAIRO Theor. Informatics Appl..

[2]  Grzegorz Rozenberg,et al.  On ET0L Systems of Finite Index , 1978, Inf. Control..

[3]  Michel Latteux,et al.  Cônes Rationnels Commutativement Clos , 1977, RAIRO Theor. Informatics Appl..

[4]  Seymour Ginsburg,et al.  Uniformly Erasable AFL , 1975, J. Comput. Syst. Sci..

[5]  Sheila A. Greibach,et al.  One Way Finite Visit Automata , 1978, Theor. Comput. Sci..

[6]  Grzegorz Rozenberg,et al.  Developmental systems and languages , 1972, STOC.

[7]  Václav Rajlich.  Absolutely Parallel Grammars and Two-Way Finite State Transducers , 1972, J. Comput. Syst. Sci..

[8]  Sheila A. Greibach,et al.  The Unsolvability of the Recognition of Linear Context-Free Languages , 1966, JACM.

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

[10]  Michel Latteux.  Produit dans le Cône Rationnel Engendré par D , 1977, Theor. Comput. Sci..

[11]  J. Engelfriet.  Top-down tree transducers with regular look-ahead , 1975 .

[12]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[13]  Seymour Ginsburg,et al.  AFL with the Semilinear Property , 1971, J. Comput. Syst. Sci..

[14]  Maurice Nivat,et al.  Transduction des langages de Chomsky , 1968 .

[15]  Seymour Ginsburg,et al.  On Incomparable Abstract Family of Languages (AFL) , 1974, J. Comput. Syst. Sci..