Abstract
A class of Σautomata is considered as a partially ordered set by homomorphism relation. We show first that some classes of automata. e.g., quasiperfect automata, perfect automata and strongly cofinal automata, are lattices, and other classes, e.g., strongly connected automata, cyclic automata and cofinal automata, are not lattices. At the same time, we give algorithms for computing the least upper bound and the greatest lower bound of given two elements in each class which forms a lattice.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have