The regularity of two-way nondeterministic tree automata languages

International Journal of Foundations of Computer Science

Volumn 13, Issue 1, 2002, Pages 67-81

  Brüggemann Klein, Anne ^a   Wood, Derick ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

caterpillars; nondeterministic; Tree automata; tree regularity; two way

Indexed keywords

EID: 0012098838     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054102000959     Document Type: Conference Paper

References (19)

1. A.V. Aho. Indexed grammars: An extension of context-free grammars. Journal of the ACM, 15:647-671, 1968.
2. A. Barrero. Unranked tree languages. Pattern Recognition, 24(1):9-18, 1991.
3. T. Bray, J. P. Paoli, and C. M. Sperberg-McQueen. Extensible markup language (XML) 1.0. http://www.w3.org/TR/1998/REC-xml-19980210/, February 1998.
4. A. Bruggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1, April 3, 2001. Technical Report HKUST-TCSC-2001-05, HKUST, Theoretical Computer Science Center, Computer Science Department, Hong Kong SAR, 2001. URL: http://www.cs.ust.hk/tcsc/RR/2001- 05.ps.gz.
5. A. Bniggemann-Klein and D. Wood. Caterpillars: A context specification technique. Markup Languages: Theory &Practice, 2(1):81-106, 2000.
6. H. Comon, M. Daucher, R. Gilleron, S. Tison, and M. Tommasi. Tree automata techniques and applications, 1998. Available on the Web from 13ux02.univ-lille3.fr in directory tata.
7. F. Gecseg and M. Steinby. Tree Automata. Akademiai Kiado, Budapest, 1984.
8. F. Gecseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Volume 3, Beyond Words, pages 1-68. Springer-Verlag, Berlin, Heidelberg, New York, 1997.
9. ISO 8879: Information processing-Text and office systems-Standard Generalized Markup Language (SGML), October 1986. International Organization for Standardization.
10. E. Moriya. On two-way tree automata. Information Processing Letters, 50:117-121, 1994.
11. M. Murata. Forest-regular languages and tree-regular languages. Unpublished manuscript, 1995.
12. M. Murata. Transformation of documents and schemas by patterns and contextual conditions. In C. Nicholas and D. Wood, editors, Proceedings of the Third International Workshop on Principles of Document Processing (PODP 96), pages 153-169, Heidelberg, 1997. Springer-Verlag. Lecture Notes in Computer Science 1293.
13. M. Murata. Data model for document transformation and assembly. In E. V. Munson, C. Nicholas, and D. Wood, editors, Proceedings of the Fourth International Workshop on Principles of Digital Document Processing (PODDP 98), pages 140-152, Heidelberg, 1998. Springer-Verlag. Lecture Notes in Computer Science 1481.
14. K. Salomaa. Yield-languages of two-way pushdown tree automata. Information Processing Letters, 58:195-199, 1996.
15. M. Takahashi. Generalization of regular sets and their application to a study of context-free languages. Information and Control, 27(l):l-36, January 1975.
16. J. W. Thatcher. Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences, 1:317-322, 1967.
17. J. W. Thatcher. A further generalization of finite automata. Technical Report RC 1846, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 1967.
18. J. W. Thatcher. There's a lot more to finite automata theory than you would have thought. Technical Report RC 2852 (#13407), IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 1970.
19. J. W. Thatcher and J. B. Wright. Abstract 65T-469. Notices of the American Mathematical Society, 12:820, 1965.