Automata on DAG representations of finite trees

Charatonik, Witold

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

Automata on DAG representations of finite trees

MPS-Authors

/persons/resource/persons44232

Charatonik, Witold
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

MPI-I-1999-2-001.pdf
(Any fulltext), 345KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Charatonik, W.(1999). Automata on DAG representations of finite trees (MPI-I-1999-2-001). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-6F7A-C

Abstract

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.