Skip to main content
SpringerLink
Log in

Automaticity of semigroups of regular languages

  • Brief Communications
  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

It is proved that there exist semigroups of regular languages not possessing automatic structure of a certain special form and also that semigroups of regular languages over a one-letter alphabet are automatic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. M. Campbell, E. F. Robertson, N. Ruškuc, and R. M. Thomas, “Automatic Semigroups,” Theor. Comput. Sci. 250(1, 2), 365 (2001).

    Article  MATH  Google Scholar 

  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).

    Article  MATH  Google Scholar 

  3. K. Hashiguchi, “Representation Theorems on Regular Languages,” J. Comput. and Syst. Sci. 27, 101 (1983).

    Article  MATH  MathSciNet  Google Scholar 

  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).

    Article  MATH  Google Scholar 

  5. K. Hashiguchi, “Limitedness Theorem on Finite Automata with Distance Functions,” J. Comput. and Syst. Sci. 24, 233 (1982).

    Article  MATH  MathSciNet  Google Scholar 

  6. I. Simon, “Limited Subsets of a Free Monoid,” in Proc. 19th FOCS, Ann Arbor, Michigan (IEEE Press, 1978), pp. 143–150.

  7. J. Brzozowski, K. Culik, and A. Gabrielian, “Classification of Noncounting Events,” J. Comput. and Syst. Sci. 5, 41 (1971).

    MATH  MathSciNet  Google Scholar 

  8. M. Hoffmann and R. M. Thomas, “Automaticity and Commutative Semigroups,” Glasgow Math. J. 44(1), 167 (2002).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow State University, Leninskie Gory, Moscow, 119899, Russia

    E. E. Khazova

Authors
  1. E. E. Khazova
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © E.E. Khazova, 2007, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2007, Vol. 62, No. 6, pp. 55–59.

About this article

Cite this article

Khazova, E.E. Automaticity of semigroups of regular languages. Moscow Univ. Math. Bull. 62, 247–250 (2007). https://doi.org/10.3103/S0027132207060071

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132207060071

Keywords

Search

Navigation