Abstract
We look at some classes of two-way transducers with auxiliary memory and investigate their containment and equivalence problems. We believe that our results are the strongest known to date concerning two-way transducers.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Culik, K., Karhumaki, J.: The equivalence of finite valued transducers (on HDTOL languages) is decidable. Theoret. Comput. Sci. 47, 71–84 (1986)
Ginsburg, S., Greibach, S.: Deterministic context-free languages. Inform. and Control 9, 620–648 (1966)
Griffiths, T.: The unsolvability of the equivalence problem for Λ-free nondeterministic generalized sequential machines. J. Assoc. Comput. Mach. 15, 409–413 (1968)
Gurari, E.: The equivalence problem for deterministic two-way sequential transducers is decidable. SIAM J. Comput. 11, 448–452 (1982)
Gurari, E., Ibarra, O.H.: The complexity of decision problems for finite-turn multicounter machines. J. Comput. Syst. Sci. 22, 220–229 (1981)
Gurari, E., Ibarra, O.H.: A note on finite-valued and finitely ambiguous transducers. Math. Systems Theory 16, 61–66 (1983)
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach. 25, 116–133 (1978)
Ibarra, O.H.: The unsolvability of the equivalence problem for ε-free NGSM’s with unary input (output) alphabet and applications. SIAM J. Computing 7, 524–532 (1978)
Ibarra, O.H.: On the universe, disjointness, and containment problems for simple machines. Inf. Comput. 208, 1273–1282 (2010)
Ibarra, O.H., Seki, S.: Characterizations of bounded semilinear languages by one-way and two-way deterministic machines. In: Proc. 13th Int. Conf. on Automata and Formal Languages (to appear, 2011)
Weber, A.: Decomposing finite-valued trasnsducers and deciding their equivalence. SIAM. J. on Computing 22, 175–202 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibarra, O.H., Yen, HC. (2011). On Two-Way Transducers. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-22321-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22320-4
Online ISBN: 978-3-642-22321-1
eBook Packages: Computer ScienceComputer Science (R0)