Congruence and homomorphism of lattice-valued tree automata
From MaRDI portal
Publication:2992571
Recommendations
- Congruences, homomorphisms and languages of tree automata
- Lattice-Semigroups Tree Automation’s Congruence and Homomorphism
- Algebraic properties of complete residuated lattice valued tree automata
- State hyperstructures of tree automata based on lattice-valued logic
- Homomorphism of lattice-valued fuzzy finite automata
Cited in
(10)- Homomorphism of finite states automata based on lattice-ordered monoids
- Algebraic properties of complete residuated lattice valued tree automata
- Congruences and homomorphisms on \(\Omega\)-algebras.
- Homomorphism of lattice-valued fuzzy finite automata
- Lattice-Semigroups Tree Automation’s Congruence and Homomorphism
- Homomorphisms in lattices of quantum automata
- State hyperstructures of tree automata based on lattice-valued logic
- Congruences, homomorphisms and languages of tree automata
- Lattice valued relations and automata
- Lattice-valued general orthomodular automata
This page was built for publication: Congruence and homomorphism of lattice-valued tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2992571)