One-visit caterpillar tree automata

Fundamenta Informaticae

Volumn 52, Issue 4, 2002, Pages 361-375

  Okhotin, Alexander ^a   Salomaa, Kai ^a   Domaratzki, Michael ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

K visit property; Markup languages; Regular tree languages; Tree automata

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS; SGML; XML;

CATERPILLAR TREE AUTOMATA;

AUTOMATA THEORY;

EID: 0036817529     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. Berstel, J., Boasson, L.: XML grammars. Proc. Mathematical Foundations of Computer Science 2000, Bratislava, Lect. Notes Comput. Sci. 1893, pp. 182-191.
2. Berstel, J., Boasson, L.: Formal properties of XML grammars and languages. Acta Informatica 38, 2002, 649-671.
3. Brüggemann-Klein, A., Wood, D.: Caterpillars: A context-specification technique. Mark-up Languages: Theory & Practice 2, 2000, 81-106.
4. Brüggemann-Klein, A., Wood, D.: The regularity of two-way nondeterministic tree automata languages. International Journal of Foundations of Computer Science 13, 2002, 67-81.
5. Engelfriet, J., Hoogeboom, H.J., van Best, J.P.: Trips on trees. Acta Cybernetica 14, 1999, 51-64.
6. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest, 1984.
7. Gécseg, F., Steinby, M.: Tree Languages. In: Handbook of Formal Languages, Vol. 3, G. Rozenberg and A. Salomaa (Eds.), Springer-Verlag, 1997, pp. 1-68.
8. Kamimura, T.: Tree automata and attribute grammars. Information and Control 57, 1983, 1-20.
9. Kamimura, T., Slutzki, G.: Parallel and two-way automata on directed ordered acyclic graphs. Information and Control 49, 1981, 10-51.
10. Slutzki, G.: Alternating tree automata. Theoretical Computer Science 41, 1985, 305-318.
11. Wood, D.: Standard generalized markup language: Mathematical and philosophical issues. In: Computer Science Today, J. van Leeuwen (Ed.), Lect. Notes Comput. Sci. 1000, Springer-Verlag 1995, pp. 344-365.