ABOUT AN EQUIVALENCE RELATION ON THE SET OF REGULAR LANGUAGES AND ITS PROPERTIES

Vasily Dolgov · CyberLeninK (CyberLeninka) · 2012

Keywords: equivalence relation; regular languages; finite automata.Annotation: In this paper, an equivalence relation on the set of regular languages is introduced. This relation allows us to consider only a final number of languages (automata) while investigating automata with fixed number of states.

Read the paper · More papers on PaperTik