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

2021 ◽  
Author(s):  
Maryam Ghorani ◽  
Somaye Moghari
Keyword(s):  
Tree Automata ◽  
Complete Lattices

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.

Q-orders with no unit on Q

2021 ◽  
pp. 1-8
Author(s):  
Cheng-Jie Zhou ◽  
Wei Yao
Keyword(s):  
Ordered Sets ◽  
Complete Lattices ◽  
Definition Of ◽  
Self Adaptive

For a usual commutative quantale Q (does not necessarily have a unit), we propose a definition of Q-ordered sets by introducing a kind of self-adaptive self-reflexivity. We study their completeness and the related Q-modules of complete lattices. The main result is that, the complete Q-ordered sets and the Q-modules of complete lattices are categorical isomorphic.

Sign in / Sign up

Export Citation Format

Share Document