Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics

2015 ◽  
pp. 90-102 ◽  
Author(s):  
Manfred Droste ◽  
Doreen Heusel ◽  
Heiko Vogler
Keyword(s):  
Tree Automata ◽  
Weighted Logics

scholarly journals Weighted tree automata and weighted logics

2006 ◽  
Vol 366 (3) ◽  
pp. 228-247 ◽  
Author(s):  
Manfred Droste ◽  
Heiko Vogler
Keyword(s):  
Tree Automata ◽  
Weighted Tree ◽  
Weighted Tree Automata ◽  
Weighted Logics

Weighted Logics for Unranked Tree Automata

2009 ◽  
Vol 48 (1) ◽  
pp. 23-47 ◽  
Author(s):  
Manfred Droste ◽  
Heiko Vogler
Keyword(s):  
Tree Automata ◽  
Weighted Logics

Multiple Regularity and Binary ETOL-Systems1

1981 ◽  
Vol 4 (1) ◽  
pp. 19-34
Author(s):  
Ryszard Danecki
Keyword(s):  
Equivalence Problem ◽  
Tree Automata ◽  
Closure Properties ◽  
Multiple Tree

Closure properties of binary ETOL-languages are investigated by means of multiple tree automata. Decidability of the equivalence problem of deterministic binary ETOL-systems is proved.

Some Structural Properties of Systolic Tree Automata

1989 ◽  
Vol 12 (4) ◽  
pp. 571-585
Author(s):  
E. Fachini ◽  
A. Maggiolo Schettini ◽  
G. Resta ◽  
D. Sangiorgi
Keyword(s):  
Structural Properties ◽  
Stability Problem ◽  
Sufficient Condition ◽  
Tree Automata ◽  
Necessary And Sufficient Condition ◽  
The Stability ◽  
Necessary And Sufficient

We prove that the classes of languages accepted by systolic automata over t-ary trees (t-STA) are always either equal or incomparable if one varies t. We introduce systolic tree automata with base (T(b)-STA), a subclass of STA with interesting properties of modularity, and we give a necessary and sufficient condition for the equivalence between a T(b)-STA and a t-STA, for a given base b. Finally, we show that the stability problem for T(b)-ST A is decidible.

Sign in / Sign up

Export Citation Format

Share Document