Automaticity of semigroups of regular languages
-
Published:2007-12
Issue:6
Volume:62
Page:247-250
-
ISSN:0027-1322
-
Container-title:Moscow University Mathematics Bulletin
-
language:en
-
Short-container-title:Moscow Univ. Math. Bull.
Subject
General Mathematics
Reference8 articles.
1. C. M. Campbell, E. F. Robertson, N. Ruškuc, and R. M. Thomas, “Automatic Semigroups,” Theor. Comput. Sci. 250(1, 2), 365 (2001).
2. S. Afonin and E. Hazova, “Membership and Finiteness Problems for Rational Sets of Regular Languages,” Int. J. Found. Comput. Sci. 17(3), 493 (2006).
3. K. Hashiguchi, “Representation Theorems on Regular Languages,” J. Comput. and Syst. Sci. 27, 101 (1983).
4. J. Karhumäki and L. P. Lisovik, “The Equivalence Problem of Finite Substitutions on ab*c, with Applications,” Int. J. Found. Comput. Sci. 14(4), 699 (2003).
5. K. Hashiguchi, “Limitedness Theorem on Finite Automata with Distance Functions,” J. Comput. and Syst. Sci. 24, 233 (1982).