Formal schemes for language translations

References

• Aho , A.V. and Ullman , J.D. 1969 . Syntax Directed Translations and the Pushdown Assembler . J. Comp. System Science , 3 : 37 – 56 .
   Google Scholar
• Aho , A.V. and Ullman , J.D. 1969 . Properties of Syntax Directed Translations . J.Comp. Science , 3 : 319 – 334 .
   Google Scholar
• Culik , K. II . 1967 . Relation represented by n-tape automata . Kybernetika , 3 : 321 – 345 . in Czech
   Google Scholar
• Culik , K. II . 1970 . n-ary Grammars and the Description of Mapping of Languages . Kybernetika , 6 : 99 – 117 .
   Google Scholar
• Elgot , C.C. and Mezei , J.E. 1965 . On relations defined by generalized finite automata . IBMJ. Res. Develop , 9 : 47 – 68 .
   Web of Science ®Google Scholar
• Fischer , P.C. and Rosenberg , A.L. 1968 . Multitape one-way nonwriting automata . J. Comp. System Sci. , 2 : 88 – 101 .
   Google Scholar
• Ginsburg , S. and Rose , G.F. 1966 . Preservation of Languages by Transducers . Inf. and Control , 9 : 153 – 176 .
   Google Scholar
• Ginsburg , S. and Rose , G.F. 1968 . A Note on Preservation of Languages by Transducers . Inf. and Control , 12 : 549 – 552 .
   Google Scholar
• Ibarra , O.H. 1968 . Characterisations of Transductions Definen by Abstract Families of Transducers will appear . J. Math. Systems Theory , 12
   Google Scholar
• Kuroda , S.Y. 1964 . Classes of languages and linear-bounded automata . Inf.and Control , 7 : 207 – 223 .
   Google Scholar
• Lewis , P.M. II and Stearns , R.E. 1968 . Syntax directed transductions . J. Assoc. Comput. Mach , 15 : 464 – 488 .
   Web of Science ®Google Scholar
• Matthews , G.H. 1963 . Discontinuity and asymmetry in phrase structure grammars . Inf and Control , 6 : 137 – 146 .
   Google Scholar
• Nash , B.O. and Cohen , R.S. 1969 . Parallel Leveled Grammars . IEEE Conference Record of 1969 Tenth Annual Symp on Switching and Automata Theory . 1969 .
   Google Scholar
• Hopcroft , J.D. and Ullman , J.D. 1969 . Formal Languages and their relation to automata , Reading , Mass : Addison & Wesley .
   Google Scholar
• Ginsburg , S. 1966 . The Mathematical Theory of Context-Free Languages , New York : McGraw-Hill .
   Google Scholar
• Ginsburg , S. , Greibach , S. and Harrison , M. 1967 . One-way stack automata . J. Assoc. Comput. Mach , 14 : 389 – 418 .
   Web of Science ®Google Scholar
• Morey , C.J.W. 1970 . Translations using binary grammars , Waterloo , Ontario : University of Waterloo . Master's Thesis
   Google Scholar