Transductions and the parallel generation of languagesFootnote^†

^†This research was supported by the National Sciences and Engineering Council of Canada under grant No. A-7403 and by the National Science Foundation of the United States of America under grant MCS-8003348.

References

• Berstel , J. 1979 . Transductions and Context-Free Languages , Edited by: Teubner , B.G. Stutgart .
   Google Scholar
• Blattner , M. and Head , T. 1977 . Single-valued a-transducers . J. Computer and System Sciences , 15 : 310 – 327 .
   Google Scholar
• Culik , K. II and Head , T. 1981 . Transductions and the Parallel Generation of Language , Waterloo, , Canada : University of Waterloo . Research Report CS-81-03, Faculty of Mathematics, N2L 3G1
   Google Scholar
• Culik , K. II and Opatrny , J. 1974 . “ Context in parallel rewriting ” . In L Systems , Edited by: Rozenberg , G. and Salomaa , A. New York : Springer-Verlag .
   Google Scholar
• De Luca , A. and Restivo , A. 1980 . A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup . Information and Control , 44 : 300 – 319 .
   Google Scholar
• Ginsburg , S. 1975 . Algebraic and Automata-Theoretic Properties of Formal Languages , New York : North-Holland . American Elsevier
   Google Scholar
• Griffiths , T.V. 1968 . The unsolvability of the equivalence problem for A-free non-deterministic generalized machines . J. Association for Computing Machinery , 15 : 409 – 413 .
   Google Scholar
• Head , T. 1979 . Codeterministic Lindenmayer schemes and systems . J. Computer and System Sciences , 19 : 203 – 210 .
   Google Scholar
• Head , T. 1980 . A-transducers and the monotonicity of IL schemes . J. Computer and System Sciences , 21 : 87 – 91 .
   Google Scholar
• Herman , G.T. and Rozenberg , G. 1975 . Developmental Systems and Languages , Amsterdam : North-Holland .
   Google Scholar
• Leguy-Cordellier , J. 1980 . Transductions Rationelles Décroissantes et Substitution , Université de Lille . Thèse 3ème cycle
   Google Scholar
• Lindenmayer , A. 1978 . Developmental algorithms—an application of formal language theory to biology, Materialienhefte IX, “Gestaltbildung—processe 3” , 27 – 44 . Universität Bielefeld . Schwerpunkt Mathematisierung der Einzel Wissenschaften
   Google Scholar
• Lindenmayer , A. 1980 . Personal communication .
   Google Scholar
• Mcnaughton , R. and Papert , S. 1971 . Counter-Free Automata , Cambridge, Massachusetts : M.I.T. Press .
   Google Scholar
• Minsky , M.L. 1961 . Recursive unsolvability of Post's problem of “TAG” and other topics in the theory of Turing machines . Annals of Mathematics , 74 : 437 – 455 .
   Google Scholar
• Rozenberg , G. 1977 . Selective substitution' grammars (towards a framework for rewriting systems) Part I: Definitions and examples . EIK , 13 : 455 – 463 .
   Google Scholar
• Rozenberg , G. and Salomaa , A. 1980 . The Mathematical Theory of L Systems , New York : Academic Press .
   Google Scholar
• Rozenberg , G. and Wood , D. 1980 . Context-free grammars with selective rewriting . Acta Informatica , 13 : 257 – 268 .
   Web of Science ®Google Scholar
• Kleijn , H.C.M. and Rozenberg , G. 1981 . “ A general framework for comparing sequential and parallel rewriting ” . Vol. 118 , 473 – 482 . New York : Springer-Verlag . Mathematical Foundations of Computer-Science 1981, Lecture Notes in Computer Science
   Google Scholar
• Rovan , Branislav. 1981 . A framework for studying grammars , Vol. 118 , 360 – 368 . New York : Springer-Verlag . Mathematical Foundations of Computer Science 1981, Lecture Notes in Computer Science
   Google Scholar
• Wood , D. 1976 . Information and control . Iterated a-NGSN maps and T systems , 32 : 1 – 26 .
   Google Scholar