An equivalence relation on suffix codes defined by generalized regular languages

References

• Benda , V. and Bendová , K . 1976 . Recognizable filters and ideals . Commentations Mathematical: Unit: Carolinae , 17 ( 2 ) : 251 – 259 .
   Google Scholar
• Berstel , J. and Perrin , D. 1985 . Theory of Coden , Academic Press .
   Google Scholar
• Brozowski , J.A. 1964 . Derivatives of regular expressions . J. Assoc. Comput. Mach , 11 ( 4 ) : 481 – 494 .
   Web of Science ®Google Scholar
• Eilenberg , S. 1974 . Automata, Languages and Machines , Vol. A , New York : Academic Press .
   Google Scholar
• Prodinger , H. 1980 . Congruences defined by languages and filters . Inform, and Control , 44 : 36 – 46 .
   Google Scholar
• Perrin , D. 1972 . Codes conjugués . inform, and Control , 20 : 221 – 231 .
   Google Scholar
• Salomaa , A. 1973 . Formal Languages , New York : Academic Press .
   Google Scholar
• Zhang , S.H. , Guo , Y.Q. and Zhang , L. 1987 . S-regular languages and their classes . Ada Math. Sinica , 30 ( 2 ) : 168 – 178 . In Chinese
   Google Scholar
• Zhang , S.H. and Guo , Y.Q. 1988 . Two notes on the classes of S-regular languages . Ada Math. Sinica , 31 ( 1 ) : 125 – 130 . In Chinese
   Google Scholar