Skip to main content
SpringerLink
Log in

A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1982)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Babai: Moderately exponential bound for graph isomorphism, FCT 81, Lecture Notes in Comp. Sci. 117, Springer 1981, 34–50.

    Google Scholar 

  2. K. S. Booth: Isomorphism testing for graphs, semigroups and finite automata are polynomially equivalent problems, SIAM J. Comput. 7 (1978), 273–279.

    Article  MathSciNet  Google Scholar 

  3. K. S. Booth, Ch. J. Colbourn: Problems polynomially equivalent to graph isomorphism, Tech. Rep. CS-77-04, Univ. of Waterloo, 1979.

    Google Scholar 

  4. N. Christofides: Graph theory, an algorithmic approach, Acad. Press, New York, London, San Francisco, 1975.

    MATH  Google Scholar 

  5. A. H. Clifford, G. B. Preston: The algebraic theory of semigroups, AMS, Providence, Rhode Island, 1967.

    MATH  Google Scholar 

  6. L. Kučera, V. Trnková: Isomorphism completeness for some algebraic structures, FCT 81, Lecture Notes in Comp. Sci. 117, Springer 1981, 218–225.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, 118 00, Praha 1, Russia

    A. Goralčíková, P. Goralčík & V. Koubek

Authors
  1. A. Goralčíková
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Goralčík
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. Koubek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goralčíková, A., Goralčík, P., Koubek, V. (1982). A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012777

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11576-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation