Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J.E. Hopcroft and J.D. Ullman, An Approach to a Unified Theory of Automata, The Bell System Technical Journal 46 (1967), 1793–1829.
A.V. Aho, J.E. Hopcroft and J.D. Ullman, A General Theory of Translation, Mathematical Systems Theory 3 (1969), 193–221.
J.E. Hopcroft and J.D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley 1969
A.V. Aho and J.D. Ullman, A Characterization of Two-Way Deterministic Classes of Languages, JCSS 4 (1970), 523–538.
V. Rajlich, Bounded-Crossing Transducers, Information and Control 27 (1975), 329–335.
D. Scott, Some Definitional Suggestions for Automata Theory, JCSS 1 (1967), 187–212.
G. Ausiello, Simple Programs on Strings and Their Decision Problems, University of Rome, R.75-17, 1975.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chytil, M.P., Jákl, V. (1977). Serial composition of 2-way finite-state transducers and simple programs on strings. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive