Automata on DAG representations of finite trees

Charatonik, Witold

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

報告書

Automata on DAG representations of finite trees

MPS-Authors

/persons/resource/persons44232

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

External Resource

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

MPI-I-1999-2-001.pdf
(全文テキスト（全般）), 345KB

付随資料 (公開)

There is no public supplementary material available

引用

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

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

要旨

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.