Equivalence between Mizumoto lattice finite automata

DOI10.1007/978-3-540-88914-4_5MaRDI QIDQ3079367zbMATH OpenOpenAlexFDO

Authors Yang Wang, Zhiwen Mo

Publication date 2 March 2011

Published in Advances in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88914-4_5

zbMATH Keywords

equivalencelattice-ordered monoidlattice finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Ordered semigroups and monoids (06F05)

Recommendations

• Lattice Minimal Automata and Lattice Reduced Automata
• Minimization of states in automata theory based on finite lattice-ordered monoids
• scientific article; zbMATH DE number 6401756
• Homomorphism of finite states automata based on lattice-ordered monoids
• Minimization of lattice automata

This page was built for publication: Equivalence between Mizumoto lattice finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079367)