On characterisation of language families in terms of inverse morphisms

References

• Autebert , J.‐ M. 1977 . Non-principalite du cylindre des langages à compteur . Math. Systems Theory , 11 : 157 – 167 .
   Google Scholar
• Autebert , J.‐ M. and Boasson , L. 1980 . “ Generators of cones and cylinders, in ” . In Formal Language Theory, Perspectives and Open Problems , Edited by: Book , R. V. 49 – 49-87 . New York : Academic Press .
   Google Scholar
• Boasson , L. and Nivat , M. 1977 . Le cylindre des langages linéaires . Math. Systems Theory , 11 : 147 – 155 .
   Google Scholar
• Book , R. V. and Greibach , S. 1970 . Quasi-realtime languages . Math. Systems Theory , 4 : 97 – 111 .
   Google Scholar
• Book , R. V. , Greibach , S. and Wrathall , C. 1979 . Reset machines . J. Comput. System Sci , 19 : 256 – 276 .
   Google Scholar
• Book , R. V. , Nivat , M. and Paterson , M. 1974 . Reversal-bounded acceptors and intersections of linear languages . SIAM J. Comput , 3 : 283 – 295 .
   Google Scholar
• Culik II , K. 1974 . On some families of languages related to developmental systems . Internat. J. Comput. Math , 4 : 31 – 42 .
   Google Scholar
• Culik II , K. and Maurer , H. A. 1979 . On simple representations of language families . RAIRO Inform. Théor , 13 : 241 – 250 .
   Google Scholar
• Engelfriet , J. and Rozenberg , G. 1980 . Fixed point languages, equality languages, and representation of recursively enumerable languages . J. Assoc. Comput. Mach , 27 : 499 – 518 .
   Web of Science ®Google Scholar
• Gaifman , H. and Shamir , E. 1980 . Roots of the hardest context free language and other constructs . SIGACT News , 27 Fall
   Google Scholar
• Ginsburg , S. 1975 . Algebraic and Automata-Theoretic Properties of Formal Languages , North-Holland : Amsterdam .
   Google Scholar
• Ginsburg , S. and Harrison , M. A. 1968 . One-way nondeterministic real-time list-storage languages . J. Assoc. Comput. Mach , 15 : 428 – 446 .
   Google Scholar
• Greibach , S. 1973 . The hardest context-free language . SIAM J. Comput , 2 : 304 – 310 .
   Google Scholar
• Jantzen , M. 1979 . On zerotestin-bounded multicounter machines . Lecture Notes Comput. Sci , 67 : 158 – 169 .
   Google Scholar
• Karhumaki , J. and Linna , M. 1983 . A note on morphic characterization of languages . Discrete Appl. Math , 5 : 243 – 246 .
   Google Scholar
• Latteux , M. and Leguy , J. 1983 . On the composition of morphisms and inversemorphisms . Lecture Notes Comput. Sci , 154 : 420 – 432 .
   Google Scholar
• Rozenberg , G. 1980 . “ A survey of results and open problems in the mathematical theory of L systems, in ” . In Formal Language Theory, Perspectives and Open Problems , Edited by: Book , R. V. 195 – 239 . New York : Academic Pres .
   Google Scholar
• Salomaa , A. 1981 . Jewels of Formal Language Theory , Rockville, Maryland : Computer Science Press .
   Google Scholar
• Turakainen , P. 1982 . On homomorphic characterization of principal semiAFLs without using intersection with regular sets . Information Sciences , 27 : 141 – 149 .
   Google Scholar
• Turakainen , P. 1983 . A machine-oriented approach to compositions of morphisms and inverse morphisms . Bulletin of EATCS , 20 : 162 – 166 .
   Google Scholar
• Turakainen , P. 1984 . “ Transducers and compositions of morphisms and inverse morphisms, in ” . In Studies in Honour of Arto Kustaa Salomaa on the Occasion of his Fiftieth Birthday, Ann. Univ. Turku , A Vol. 186 , 118 – 128 .
   Google Scholar
• Ullian , J. S. 1971 . Three theorems concerning principal AFL . J. Comput. System Sci , 5 : 304 – 314 .
   Google Scholar