Abstract
Two-way finite state transducers are considered with a fixed number of pebbles, of which the life times are nested. In the deterministic case, the transductions computed by such pebble transducers are closed under composition, and they can be realized by the composition of one-pebble transducers. The ranges of the k-pebble transducers form a hierarchy with respect to k, their finiteness problem is decidable, and they can be generated by compositions of k macro tree transducers. Related results hold in the nondeterministic case.
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.
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
G. J. Bex, S. Maneth, F. Neven; A formal model for an expressive fragment of XSLT, Information Systems 27 (2002), 21–39
J. C. Birget; Two-way automata and length-preserving homomorphisms, Math. Syst. Theory 29 (1996), 191–226
M. Blum, C. Hewitt; Automata on a 2-dimensional tape, in: Proc. 8th IEEE Symp. on Switching and Automata Theory, 155–160, 1967
A. K. Chandra, D. C. Kozen, L. J. Stockmeyer; Alternation, J. of the ACM 28 (1981), 114–133
M. P. Chytil, V. Jákl; Serial composition of 2-way finite-state transducers and simple programs on strings, in: Proc. 4th ICALP (A. Salomaa, M. Steinby, eds.), Lect. Notes in Comput. Sci. 52, Springer-Verlag, 135–147, 1977
F. Drewes, J. Engelfriet; Decidability of finiteness of ranges of tree transductions, Inform. and Comput. 145 (1998), 1–50
J. Engelfriet; Three hierarchies of transducers, Math. Systems Theory 15 (1982), 95–125
J. Engelfriet, H.J. Hoogeboom; Tree-walking pebble automata, in: Jewels are Forever (J. Karhumäki et al., eds.), Springer-Verlag, 72–83, 1999
J. Engelfriet, H.J. Hoogeboom; MSO definable string transductions and two-way finite state transducers, ACM Trans. on Computational Logic 2 (2001), 216–254
J. Engelfriet, S. Maneth; Output string languages of compositions of deterministic macro tree transducers, Technical Report 01-04, Leiden University, 2001. To appear in J. of Comp. Syst. Sci.
J. Engelfriet, G. Rozenberg, G. Slutzki; Tree transducers, L systems, and two-way machines, J. of Comp. Syst. Sci. 20 (1980), 150–202
J. Engelfriet, H. Vogler; Macro tree transducers, J. of Comp. Syst. Sci. 31 (1985), 71–146
Z. Fülöp, H. Vogler; Syntax-Directed Semantics-Formal Models based on Tree Transducers, EATCS Monographs on Theoretical Computer Science (W. Brauer, G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, 1998
F. Gécseg, M. Steinby; Tree languages, in: Handbook of Formal Languages, Volume 3 (G. Rozenberg, A. Salomaa, eds.), Chapter 1, Springer-Verlag, 1997
N. Globerman, D. Harel; Complexity results for two-way and multi-pebble automata and their logics, Theor. Comput. Sci. 169 (1996), 161–184
P. Goralčik, A. Goralčiková, V. Koubek; Alternation with a pebble, Inform. Proc. Letters 38 (1991), 7–13
J. Hartmanis; On non-determinancy in simple computing devices, Acta Informatica 1 (1972), 336–344
J. E. Hopcroft, J. D. Ullman; An approach to a unified theory of automata, The Bell System Technical Journal 46 (1967), 1793–1829. Also in: IEEE Record of the 8th Annual Symposium on Switching and Automata Theory, 140–147, 1967
N. D. Jones; Space-bounded reducibility among combinatorial problems, J. of Comp. Syst. Sci. 11 (1975), 68–85
T. Milo, D. Suciu, V. Vianu; Typechecking for XML transformers, in: Proc. 19th ACM Symposium on Principles of Database Systems (PODS 2000), 11–22, 2000. To appear in J. of Comp. Syst. Sci.
F. Neven, J. Van den Bussche; Expressiveness of structured document query languages based on attribute grammars, in: Proc. 17th ACM Symposium on Principles of Database Systems (PODS 1998), 11–17, 1998. To appear in J. of the ACM
F. Neven, T. Schwentick, V. Vianu; Towards regular languages over infinite alphabets, in: Proc. MFCS 2001 (J. Sgall, A. Pultr, P. Kolman, eds.), Lect. Notes in Comput. Sci. 2136, Springer-Verlag, 560–572, 2001
Y. Papakonstantinou, V. Vianu; DTD inference for views of XML data; Proc. 19th ACM Symposium on Principles of Database Systems (PODS 2000), 35–46, 2000
H. Petersen; The equivalence of pebbles and sensing heads for finite automata, in: Proc. FCT’97 (B. S. Chlebus, L. Czaja, eds.), Lect. Notes in Comput. Sci. 1279, Springer-Verlag, 400–410, 1997
M.O. Rabin, D. Scott; Finite automata and their decision problems, IBM J. Res. Devel. 3 (1959), 115–125
R. W. Ritchie, F. N. Springsteel; Language recognition by marking automata, Inf. and Control 20 (1972), 313–330
J.C. Shepherdson; The reduction of two-way automata to one-way automata, IBM J. Res. Devel. 3 (1959), 198–200
V. Vianu; A Web Odyssey: from Codd to XML, in: Proc. 20th ACM Symposium on Principles of Database Systems (PODS 2001), 1–15, 2001
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelfriet, J., Maneth, S. (2002). Two-Way Finite State Transducers with Nested Pebbles. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_19
Download citation
DOI: https://doi.org/10.1007/3-540-45687-2_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44040-6
Online ISBN: 978-3-540-45687-2
eBook Packages: Springer Book Archive