Recognisable languages over an algebra
Rukiye Cavus · Open Repository and Bibliography (University of Liège) · 2010
Recognisable language L over free monoid M (i.e those accepted by finite automata) can be characterized by means of their associated syntactic congruence ≡L. Thanks to this, the notion can be generalized in order to define recognisable languages over any kind of algebra (group, ring...). This generalization will be illustrated by some examples. The set Reg(A) of recognizable languages over an algebra A is a Boolean algebra. We present N.Pippenger’s characterization of its dual space (in the sense of Stone).