Title: HOMOMORPHISM OF FINITE STATES AUTOMATA BASED ON LATTICE-ORDERED MONOIDS
Abstract: In this article,we consider homomorphism and strong homomorphism of lattice-valued finite states automata(LFSA),and study some properties of homomorphism and strong homomorphism of LFSAs.By using the concept of strong homomorphism,we establish a kind of equivalence relation over states of LFSA and obtain quotient automata of LFSA.Finally,we get an isomorphism relation between quotient automata and the strong homomorphism image automata.
Publication Year: 2011
Publication Date: 2011-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot