Publication Search Form




We found publication with these paramters.

Similarity relations and cover automata

Jean-Marc Champarnaud, Franck Guingne, Georges Hansel
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.
To appear in RAIRO-ITA