License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-2281
URL: http://drops.dagstuhl.de/opus/volltexte/2005/228/

Thomas, Wolfgang ; Christau, Julien ; Löding, Christof

Deterministic Automata on Unranked Trees

pdf-format:
Dokument 1.pdf (190 KB)


Abstract

We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is possible to minimize the number of states efficiently and to obtain a unique canonical representative of the accepted tree language. For top-down deterministic automata it is well known that they are less expressive than the non-deterministic ones. By generalizing a corresponding proof from the theory of ranked tree automata we show that it is decidable whether a given regular language of unranked trees can be recognized by a top-down deterministic automaton. The standard deterministic top-down model is slightly weaker than the model we use, where at each node the automaton can scan the sequence of the labels of its successors before deciding its next move.

BibTeX - Entry

@InProceedings{thomas_et_al:DSP:2005:228,
  author =	{Wolfgang Thomas and Julien Christau and Christof L{\"o}ding},
  title =	{Deterministic Automata on Unranked Trees},
  booktitle =	{Foundations of Semistructured Data},
  year =	{2005},
  editor =	{Frank Neven and Thomas Schwentick and Dan Suciu},
  number =	{05061},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2005/228},
  annote =	{Keywords: Automata, unranked trees, parikh automata}
}

Keywords: Automata, unranked trees, parikh automata
Seminar: 05061 - Foundations of Semistructured Data
Issue date: 2005
Date of publication: 10.08.2005


DROPS-Home | Fulltext Search | Imprint Published by LZI