Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T23:03:10.650Z Has data issue: false hasContentIssue false

Similarity relations and cover automata

Published online by Cambridge University Press:  15 March 2005

Jean-Marc Champarnaud
Affiliation:
LIFAR, Université de Rouen, France; jean-marc.champarnaud@univ-rouen.fr& franck.guingne@univ-rouen.fr & georges.hansel@univ-rouen.fr
Franck Guingne
Affiliation:
LIFAR, Université de Rouen, France; jean-marc.champarnaud@univ-rouen.fr& franck.guingne@univ-rouen.fr & georges.hansel@univ-rouen.frXRCE, Xerox, 38240 Meylan, France; franck.guingne@xrce.xerox.com
Georges Hansel
Affiliation:
LIFAR, Université de Rouen, France; jean-marc.champarnaud@univ-rouen.fr& franck.guingne@univ-rouen.fr & georges.hansel@univ-rouen.fr
Get access

Abstract

Cover automata for finite languages have been much studied a few years ago.It turns out that a simple mathematical structure, namelysimilarity relations over a finite set of words, is underlying thesestudies. In the present work, we investigate in detail for themselvesthe properties of these relations beyond the scope of finite languages.New results with straightforward proofsare obtained in this generalized framework,and previous results concerning coverautomata are obtained as immediate consequences.

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable