Abstract
Call a string-to-string function regular if it can be realised by one of the following equivalent models: mso transductions, two-way deterministic automata with output, and streaming transducers with registers. This paper proposes to treat origin information as part of the semantics of a regular string-to-string function. With such semantics, the model admits a machine-independent characterisation, Angluin-style learning in polynomial time, as well as effective characterisations of natural subclasses such as one-way transducers or first-order definable transducers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., Cerný, P.: Expressiveness of streaming string transducers. In: FSTTCS 2010, pp. 1–12 (2010)
Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)
Aho, A.V., Ullman, J.D.: A characterization of two-way deterministic classes of languages. J. Comput. Syst. Sci. 4(6), 523–538 (1970)
Bloem, R., Engelfriet, J.: A comparison of tree transductions defined by monadic second order logic and by attribute grammars. J. Comput. Syst. Sci. 61(1), 1–50 (2000)
Chytil, M., Jákl, V.: Serial composition of 2-way finite-state transducers and simple programs on strings. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol. 52, pp. 135–147. Springer, Heidelberg (1977)
Engelfriet, J., Hoogeboom, H.J.: mso definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2(2), 216–254 (2001)
Engelfriet, J., Maneth, S.: Macro tree translations of linear size increase are mso definable. SIAM J. Comput. 32(4), 950–1006 (2003)
Filiot, E., Gauwin, O., Reynier, P.-A., Servais, F.: From two-way to one-way finite state transducers. In: LICS, pp. 468–477. IEEE Computer Society (2013)
Gurari, E.M.: The equivalence problem for deterministic two-way sequential transducers is decidable. SIAM J. Comput. 11(3), 448–452 (1982)
Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for top-down xml transformations. In: Paredaens, J., Van Gucht, D. (eds.) PODS, pp. 285–296. ACM (2010)
McKenzie, P., Schwentick, T., Thérien, D., Vollmer, H.: The many faces of a translation. J. Comput. Syst. Sci. 72(1), 163–179 (2006)
Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Language Theory, vol. III, pp. 389–455. Springer (1997)
van Deursen, A., Klint, P., Tip, F.: Origin tracking. J. Symb. Comput. 15(5/6), 523–545 (1993)
Weber, A., Klemm, R.: Economy of description for single-valued transducers. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 607–618. Springer, Heidelberg (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bojańczyk, M. (2014). Transducers with Origin Information. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43951-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-43951-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43950-0
Online ISBN: 978-3-662-43951-7
eBook Packages: Computer ScienceComputer Science (R0)