Similarity relations and cover automata
LIFAR, Université de Rouen, France;
email@example.com& firstname.lastname@example.org & email@example.com
2 XRCE, Xerox, 38240 Meylan, France; firstname.lastname@example.org
Cover automata for finite languages have been much studied a few years ago. It turns out that a simple mathematical structure, namely similarity relations over a finite set of words, is underlying these studies. In the present work, we investigate in detail for themselves the properties of these relations beyond the scope of finite languages. New results with straightforward proofs are obtained in this generalized framework, and previous results concerning cover automata are obtained as immediate consequences.
Mathematics Subject Classification: 68Q25 / 68Q45 / 68W01 / 68W10
Key words: Finite automata / cover automaton for a finite language / similarity relation
© EDP Sciences, 2005