Abstract
Caterpillar expressions have been introduced by Brüggemann-Klein and Wood for applications in markup languages. A caterpillar expression can be implemented as a tree walking automaton operating on unranked trees. Here we give a formal definition of determinism of caterpillar expressions that is based on the language of instruction sequences defined by the expression. We show that determinism of caterpillar expressions can be decided in polynomial time.
Work supported in part by the Natural Sciences and Engineering Research Council of Canada grants OGP0147224 (Salomaa) and OGP0041630 (Yu).
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
Berstel, J., Perrin, D.: Theory of Codes. Academic Press, Inc., London (1985)
Bojańczyk, M., Colcombet, T.: Tree walking automata cannot be determinized. Theoret. Comput. Sci. 350, 164–173 (2006)
Bojańczyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. In: Proceedings of STOC 2005, pp. 234–243. ACM Press, New York (2005)
Book, R.V., Even, S., Greibach, S., Ott, G.: Ambiguity in graphs and expressions. IEEE Trans. on Computers 20, 149–153 (1971)
Brüggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology (2001)
Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inform. Computation 142, 182–206 (1998)
Brüggemann-Klein, A., Wood, D.: Caterpillars: A context-specification technique. Mark-up Languages: Theory & Practice 2, 81–106 (2000)
Brüggemann-Klein, A., Wood, D.: Caterpillars, context, tree automata and tree pattern matching. In: Rozenberg, G., Thomas, W. (eds.) DLT 1999, pp. 270–285. World Scientific, Singapore (2000)
Comon, H., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1997), http://www.grappa.univ-lille3.fr/tata
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, New York (1974)
Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Karhumäki, J., Maurer, H., Pǎun, Gh., Rozenberg, G. (eds.) Jewels are forever, pp. 72–83. Springer, Heidelberg (1999)
Engelfriet, J., Hoogeboom, H.J., van Best, J.P.: Trips on trees. Acta Cybern. 14, 51–64 (1999)
Fernau, H.: Learning XML grammars. In: Perner, P. (ed.) MLDM 2001. LNCS (LNAI), vol. 2123, pp. 73–87. Springer, Heidelberg (2001)
Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 1–68. Springer, Heidelberg (1997)
Geffert, V.: Translation of binary regular expressions into nondeterministic ε-free automata with O(n logn) transitions. J. Comput. System Sci. 66, 451–472 (2003)
Hagenah, C., Muscholl, A.: Computing ε-free NFA from regular expressions in O(n log2(n)) time. R.A.I.R.O. Theoret. Inform. Appl. 34, 257–277 (2000)
Han, Y.-S., Salomaa, K., Wood, D.: Intercode regular languages. Fund. Informaticae 76, 113–128 (2007)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Hromkovič, J., Seibert, S., Wilke, T.: Translating regular expressions into small ε-free nondeterministic automata. J. Comput. System Sci. 62, 565–588 (2001)
Kilpeläinen, P., Wood, D.: SGML and XML document grammars and exceptions. Inform. Computation 163, 230–251 (2001)
Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. Comput. System Sci. 66, 66–97 (2002)
Murata, M., Lee, D., Mani, M.: Taxonomy of XML schema languages using formal language theory. ACM Trans. Internet Technology 5 (2005)
Neven, F., Schwentick, T.: On the power of tree walking automata. Inform. Computation 183, 86–103 (2003)
Okhotin, A., Salomaa, K., Domaratzki, M.: One-visit caterpillar tree automata. Fund. Informaticae 52, 361–375 (2002)
Salomaa, K., Yu, S., Zan, J.: Deterministic caterpillar expressions. School of Computing, Queen’s University, Tech. Report No. 2007–533 (2007)
Schnitger, G.: Regular expressions and NFA without ε-transitions. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 432–443. Springer, Heidelberg (2006)
Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: Havel, I.M., Koubek, V. (eds.) Mathematical Foundations of Computer Science 1992. LNCS, vol. 629, pp. 494–503. Springer, Heidelberg (1992)
Yu, S.: Regular languages. In: Rogenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 41–110. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salomaa, K., Yu, S., Zan, J. (2007). Deterministic Caterpillar Expressions. In: Holub, J., Žďárek, J. (eds) Implementation and Application of Automata. CIAA 2007. Lecture Notes in Computer Science, vol 4783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76336-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-76336-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76335-2
Online ISBN: 978-3-540-76336-9
eBook Packages: Computer ScienceComputer Science (R0)