Skip to main navigation Skip to search Skip to main content

Regularly extended two-way nondeterministic tree automata

  • Hong Kong University of Science and Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We establish that regularly extended two-way nondeterministic tree automata with unranked alphabets have the same expressive power as regularly extended nondeterministic tree automata with unranked alphabets. We obtain this result by establishing regularly ex-tended versions of a congruence on trees and of a congruence on, so called, views. Our motivation for the study of these tree models is the Extensible Markup Language (XML), a metalanguage for defining document grammars. Such grammars have regular sets of right-hand sides for their productions and tree automata provide an alternative and useful modeling tool for them. In particular, we believe that they provide a useful computational model for what we call caterpillar expressions.

Original languageEnglish
Title of host publicationImplementation and Application of Automata - 5th International Conference, CIAA 2000, Revised Papers
EditorsSheng Yu, Andrei Paun
PublisherSpringer Verlag
Pages57-66
Number of pages10
ISBN (Print)3540424911, 9783540424918
DOIs
StatePublished - 2001
Event5th International Conference on Implementation and Application of Automata, CIAA 2000 - London, Canada
Duration: 24 Jul 200025 Jul 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2088
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Implementation and Application of Automata, CIAA 2000
Country/TerritoryCanada
CityLondon
Period24/07/0025/07/00

Fingerprint

Dive into the research topics of 'Regularly extended two-way nondeterministic tree automata'. Together they form a unique fingerprint.

Cite this