Skip to main content
SpringerLink
Log in

A class of semisimple automata

  • Published:
Korean Journal of Computational & Applied Mathematics Aims and scope Submit manuscript

Abstract

We show that all automata in a certain natural class satisfy three semisimplicity properties and describe all languages recognized by these automata.

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. J. Berstel,Finite Automata and Rational Languages: an Introduction, in “Formal Properties of Finite Automata and Applications”, Lect. Notes Computer Science 386, Springer, New York, 1989, 2–14.

    Google Scholar 

  2. S. Eilenberg,Automata, Languages and Machines, Vol. A, B, Academic Press, New York, 1976.

    MATH  Google Scholar 

  3. E.W. Kiss, R. Pöschel, P. Pröhle,Subvarieties of Varieties Generated by Graph Algebras, Acta Sci. Math.54 (1990), 57–75.

    MATH  Google Scholar 

  4. G.F. McNulty, C. Shallon,Inherently Nonfinitely Based Finite Algebras, Lecture Notes Math.1004 (1983), 206–231.

    Article  MathSciNet  Google Scholar 

  5. S. Oates-Williams,Graphs and Universal Algebra, Lecture Notes Math.884 (1981), 351–354.

    Article  MathSciNet  Google Scholar 

  6. R.H. Oehmke,On Semisimplicity for Automata, “Words, Languages and Combinatorics” (Kyoto), World Scientific, Singapore, 1990, 373–384.

    Google Scholar 

  7. R.H. Oehmke,Automata with Complemented Lattices of Congruences, “Words, Languages and Combinatorics” (Kyoto), World Scientific, Singapore, 1992, 294–300.

    Google Scholar 

  8. R.H. Oehmke,The Direct Product of Right Congruences, Korean J. Comput. Appl. Math.5 (1998), 475–480.

    MATH  MathSciNet  Google Scholar 

  9. J.E. Pin (Ed.),Formal Properties of Finite Automata and Applications, Lect. Notes Computer Science 386, Springer, New York, 1989.

    MATH  Google Scholar 

  10. R. Pöschel,The Equational Logic for Graph Algebras, Z. Math. Logik Grundlag Math.35 (1989), 273–282.

    Article  MATH  MathSciNet  Google Scholar 

  11. R. Pöschel, W. Wessel,Classes of Graphs Definable by Graph Algebra Identities or Quasi-identities, Comment. Math. Univ. Carolinae28 (1987), 581–592.

    MATH  Google Scholar 

  12. S. Yu,Regular Languages, in “Handbook of Formal Languages”, Vol. 1, Springer, New York, 1997, 41–110.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Tasmania, G.P.O. Box 252-37, 7001, Hobart, Tasmania, Australia

    A. V. Kelarev

  2. Institute of Computer Science, Tartu University, J. Liivi 2, 50409, Tartu, Estonia

    O. V. Sokratova

Authors
  1. A. V. Kelarev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. V. Sokratova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Kelarev.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kelarev, A.V., Sokratova, O.V. A class of semisimple automata. Korean J. Comput. & Appl. Math. 8, 1–8 (2001). https://doi.org/10.1007/BF03011618

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03011618

AMS Mathematics Subject Classification

Key words and phrases

Search

Navigation