MPI-I-1999-2-001

Automata on DAG representations of finite trees

Charatonik, Witold

MPI-I-1999-2-001. March 1999, 30 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.

Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.	Attachement Size(s):
	455 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView

URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1999-2-001

BibTeX
@TECHREPORT{CharatonikMPI-I-1999-2-001, 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},}