MPI-INF/SWS Research Reports 1991-2021

2. Number - All Departments


Automata on DAG representations of finite trees

Charatonik, Witold

March 1999, 30 pages.

Status: available - back from printing

We introduce a new class of finite automata. They are usual bottom-up tree automata that run on DAG representations of finite trees. We prove that the emptiness problem for this class of automata is NP-complete. Using these automata we prove the decidability of directional type checking for logic programs, and thus we improve earlier results by Aiken and Lakshman. We also show an application of these automata in solving systems of set constraints, which gives a new view on the satisfiability problem for set constraints with negative constraints.

  • Attachement: (455 KBytes)

URL to this document:

Hide details for BibTeXBibTeX
  AUTHOR = {Charatonik, Witold},
  TITLE = {Automata on DAG representations of finite trees},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-1999-2-001},
  MONTH = {March},
  YEAR = {1999},
  ISSN = {0946-011X},