Tree Automata and Essential Subtrees

Proc. of ICDMA, 31.08-02.09.2001, Bansko, v.6, 51-60 p We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Shtrakov, Slavcho
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Discrete Mathematics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Proc. of ICDMA, 31.08-02.09.2001, Bansko, v.6, 51-60 p We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.
DOI:	10.48550/arxiv.cs/0702137