Serial composition of 2-way finite-state transducers and simple programs on strings

  • Michal P. Chytil
  • Vojtěch Jákl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


Elementary Program Simple Program Input Word Serial Composition Output Track 


  1. 1.
    J.E. Hopcroft and J.D. Ullman, An Approach to a Unified Theory of Automata, The Bell System Technical Journal 46 (1967), 1793–1829.Google Scholar
  2. 2.
    A.V. Aho, J.E. Hopcroft and J.D. Ullman, A General Theory of Translation, Mathematical Systems Theory 3 (1969), 193–221.Google Scholar
  3. 3.
    J.E. Hopcroft and J.D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley 1969Google Scholar
  4. 4.
    A.V. Aho and J.D. Ullman, A Characterization of Two-Way Deterministic Classes of Languages, JCSS 4 (1970), 523–538.Google Scholar
  5. 5.
    V. Rajlich, Bounded-Crossing Transducers, Information and Control 27 (1975), 329–335.Google Scholar
  6. 6.
    D. Scott, Some Definitional Suggestions for Automata Theory, JCSS 1 (1967), 187–212.Google Scholar
  7. 7.
    G. Ausiello, Simple Programs on Strings and Their Decision Problems, University of Rome, R.75-17, 1975.Google Scholar
  8. 8.
    G. Ausiello and M. Moscarini, On the Complexity of Decision Problems for Classes of Simple Programs on Strings, Proceedings of GI — 6. Jahrestagung (1976), Informatik — Fachberichte, Springer Verlag, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Michal P. Chytil
    • 1
  • Vojtěch Jákl
    • 1
  1. 1.Charles UniversityPraha 1 - M. StranaCzechoslovakia

Personalised recommendations