𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of systolic binary tree automata and applications

✍ Scribed by Oscar H. Ibarra; Sam M. Kim

Book ID
104706333
Publisher
Springer-Verlag
Year
1984
Tongue
English
Weight
637 KB
Volume
21
Category
Article
ISSN
0001-5903

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

A characterization of BΓΌchi tree automat
A characterization of BΓΌchi tree automata
✍ Jerzy SkurczyΕ„ski πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 68 KB

We show that a language of infinite binary trees is definable by a Ξ£ 2 -formula of the monadic second order logic of two successors (with no additional symbols) iff it can be accepted by a BΓΌchi automaton. The same result has been obtained by G. Lenzi, but our proof is simpler.