A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs

2019 ◽  
pp. 121-132
Author(s):  
Akio Fujiyoshi ◽  
Daniel Průša
Keyword(s):  
Simple Extension ◽  
Tree Automata ◽  
Finite Tree ◽  
Connected Graphs ◽  
Defining Sets

Deciding Equivalence of Finite Tree Automata

1990 ◽  
Vol 19 (3) ◽  
pp. 424-437 ◽  
Author(s):  
Helmut Seidl
Keyword(s):  
Tree Automata ◽  
Finite Tree

scholarly journals A Congruence-Based Perspective on Finite Tree Automata

2022 ◽  
Vol 184 (1) ◽  
pp. 1-47
Author(s):  
Pierre Ganty ◽  
Elena Gutiérrez ◽  
Pedro Valero
Keyword(s):  
Expressive Power ◽  
Tree Automata ◽  
Minimization Algorithm ◽  
Top Down ◽  
Finite Tree ◽  
Bottom Up ◽  
Original Result

We provide new insights on the determinization and minimization of tree automata using congruences on trees. From this perspective, we study a Brzozowski’s style minimization algorithm for tree automata. First, we prove correct this method relying on the following fact: when the automata-based and the language-based congruences coincide, determinizing the automaton yields the minimal one. Such automata-based congruences, in the case of word automata, are defined using pre and post operators. Now we extend these operators to tree automata, a task that is particularly challenging due to the reduced expressive power of deterministic top-down (or equivalently co-deterministic bottom-up) automata. We leverage further our framework to offer an extension of the original result by Brzozowski for word automata.

scholarly journals FINITE TREE AUTOMATA ON INFINITE TREES

10.5109/13369 ◽  
1985 ◽  
Vol 21 (3/4) ◽  
pp. 71-82 ◽  
Author(s):  
Takeshi Hayashi ◽  
Satoru Miyano
Keyword(s):  
Tree Automata ◽  
Finite Tree ◽  
Infinite Trees
Sign in / Sign up

Export Citation Format

Share Document