Skip to main content
SpringerLink
Log in

Classifying regular languages by their syntactic algebras

  • Chapter
  • First Online:
Book cover Results and Trends in Theoretical Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 812))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Almeida: On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics. Algebra Universalis 27 (1990), 333–350.

    Google Scholar 

  2. J.R. Büchi: Finite automata, their algebras and grammars. Towards a theory of formal expressions (ed. D. Siefkes). Springer-Verlag, New York 1989.

    Google Scholar 

  3. S. Burris and H.P. Sankappanavar: A course in universal algebra. Springer-Verlag, New York 1981.

    Google Scholar 

  4. J. Černý, A. Pirická and B. Rosenauerová: On directable automata. Kybernetika (Praha) 7(1971), 289–297.

    Google Scholar 

  5. P.M. Cohn: Universal algebra (2. ed.). D. Reidel Publ. Company, Dordrecht 1981.

    Google Scholar 

  6. S. Eilenberg: Automata, languages, and machines. Volume B. Academic Press, New York 1976.

    Google Scholar 

  7. J.M. Howie: Automata and languages. Clarendon Press, Oxford 1991.

    Google Scholar 

  8. G. Lallement: Semigroups and combinatorial applications. John Wiley & Sons, NewYork 1979.

    Google Scholar 

  9. J.E. Pin: Varieties of formal languages. North Oxford Academic Publ., London 1986.

    Google Scholar 

  10. M. Steinby: Syntactic algebras and varieties of recognizable sets. Les arbres en algèbre et en programmation, 4éme Colloque de Lille (Proc. Colloq., Lille 1979), University of Lille, Lille 1979, 226–240.

    Google Scholar 

  11. M. Steinby: Some algebraic aspects of recognizability. Fundamentals of computation theory (Proc. Conf., Szeged 1981). Lect. Notes in Comput. Sci. 117, Springer-Verlag, Berlin 1981, 360–372.

    Google Scholar 

  12. M. Steinby: A theory of tree language varieties. Tree automata and languages (eds. M. Nivat and A. Podelski), Elsevier Science Publishers B.V., Amsterdam 1992, 57–81.

    Google Scholar 

  13. D. Thérien: Classification of regular languages by congruences. Rep. CS-80-19, University of Waterloo, Dept. Comput. Sci., Waterloo, Ontario 1980.

    Google Scholar 

  14. D. Thérien: Recognizable languages and congruences. Semigroup Forum 23 (1981), 371–373.

    Google Scholar 

  15. W. Wechler: Universal algebra for computer scientists. EATCS Monographs on theoretical computer science, Vol. 25, Springer-Verlag, Berlin 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, Finland

    Magnus Steinby

Authors
  1. Magnus Steinby
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Juliani Karhumäki Hermann Maurer Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Steinby, M. (1994). Classifying regular languages by their syntactic algebras. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-58131-6_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58131-4

  • Online ISBN: 978-3-540-48445-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation