Propositional Tree Automata

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/11805618_5 ◽

2006 ◽

pp. 50-65 ◽

Cited By ~ 9

Author(s):

Joe Hendrix ◽

Hitoshi Ohsaki ◽

Mahesh Viswanathan

Keyword(s):

Tree Automata

Multiple Regularity and Binary ETOL-Systems1

Fundamenta Informaticae ◽

10.3233/fi-1981-4103 ◽

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.

Relating word and tree automata

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1996.561360 ◽

2002 ◽

Cited By ~ 10

Author(s):

O. Kupferman ◽

S. Safra ◽

M.Y. Vardi

Keyword(s):

Tree Automata

Decidability of the minimization of fuzzy tree automata with membership values in complete lattices

Journal of Applied Mathematics and Computing ◽

10.1007/s12190-021-01529-6 ◽

2021 ◽

Author(s):

Maryam Ghorani ◽

Somaye Moghari

Keyword(s):

Tree Automata ◽

Complete Lattices

Some Structural Properties of Systolic Tree Automata

Fundamenta Informaticae ◽

10.3233/fi-1989-12409 ◽

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.

Weighted Tree Automata and Tree Transducers

Monographs in Theoretical Computer Science - Handbook of Weighted Automata ◽

10.1007/978-3-642-01492-5_9 ◽

2009 ◽

pp. 313-403 ◽

Cited By ~ 32

Author(s):

Zoltán Fülöp ◽

Heiko Vogler

Keyword(s):

Tree Automata ◽

Weighted Tree ◽

Tree Transducers ◽

Weighted Tree Automata

Encoding Nondeterministic Fuzzy Tree Automata Into Recursive Neural Networks

IEEE Transactions on Neural Networks ◽

10.1109/tnn.2004.837585 ◽

2004 ◽

Vol 15 (6) ◽

pp. 1435-1449 ◽

Cited By ~ 14

Author(s):

M. Gori ◽

A. Petrosino

Keyword(s):

Neural Networks ◽

Tree Automata ◽

Recursive Neural Networks

Structure-preserved error-correcting tree automata for syntactic pattern recognition

10.1109/cdc.1976.267768 ◽

1976 ◽

Cited By ~ 12

Author(s):

S. Y. Lu ◽

K. S. Fu

Keyword(s):

Pattern Recognition ◽

Tree Automata ◽

Syntactic Pattern Recognition ◽

Syntactic Pattern

RELATIVE COGENERATIONS WITH APPLICATIONS TO TREE AUTOMATA AND A THEORY OF ABSTRACT ALGEBRAS WITH FEEDBACK MODIFICATIONS

Demonstratio Mathematica ◽

10.1515/dema-1987-1-217 ◽

1987 ◽

Vol 20 (1-2) ◽

pp. 191-214

Author(s):

Jözef Stominski

Keyword(s):

Tree Automata

Deciding Equivalence of Finite Tree Automata

SIAM Journal on Computing ◽

10.1137/0219027 ◽

1990 ◽

Vol 19 (3) ◽

pp. 424-437 ◽

Cited By ~ 100

Author(s):

Helmut Seidl

Keyword(s):

Tree Automata ◽

Finite Tree

The complexity of tree automata and logics of programs

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21949 ◽

1988 ◽

Cited By ~ 133

Author(s):

E.A. Emerson ◽

C.S. Jutla

Keyword(s):

Tree Automata ◽

Logics Of Programs