𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rabin tree automata and finite monoids

✍ Scribed by Danièle Beauquier; Andreas Podelski

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
858 KB
Volume
134
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite automata on timed ω-trees
Finite automata on timed ω-trees
✍ Salvatore La Torre; Margherita Napoli 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 264 KB

In the last decade Alur and Dill introduced a model of automata on timed !-sequences which extends the traditional models of ÿnite automata. In this paper, we present a theory of timed !-trees which extends both the theory of timed !-sequences and the theory of !-trees. The main motivation is to int

On ground tree transformations and congr
On ground tree transformations and congruences induced by tree automata
✍ Sándor Vágvölgyi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 230 KB

For a tree automaton A over a ranked alphabet , we study the ground tree transformation (A) induced by A and the restriction Â(A) of the congruence ↔ \* A to terms over . We deÿne a congruence relation ⊆ A × A on A, called the determiner of A, and the quotient tree automaton A= . We show the followi