𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Kleene Theorem for Weighted Tree Automata

✍ Scribed by Manfred Droste; Christian Pech; Heiko Vogler

Publisher
Springer
Year
2004
Tongue
English
Weight
418 KB
Volume
38
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A kleene-like characterization of langua
A kleene-like characterization of languages accepted by systolic tree automata
✍ E. Fachini; A. Monti πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 686 KB

We present a Kleen-like characterization of the class of languages accepted by systolic binary tree automata, L(SBTA). This characterization uses union, intersection, restricted concatenation, restricted concatenation closure, and finite substitution closure. The restrictions we impose on the operat