Skip to main content

On the size of independent systems of equations in semigroups

  • Contributions
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1994 (MFCS 1994)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.H. Albert, J. Lawrence, A proof of Ehrenfeucht's Conjecture, Theoretical Computer Science 41 (1985) 121–123.

    Google Scholar 

  2. K. Culik II, J. Karhumäki, System of equations over a free monoid and Ehrenfeucht's Conjecture, Discrete Math. 43 (1983) 139–153.

    Google Scholar 

  3. S. Eilenberg, M.P. Schützenberger, Rational sets in commutative monoids, J. of Algebra 13 (1969) 173–191.

    Google Scholar 

  4. T. Harju, J. Karhumäki, W. Plandowski, Compactness of systems of equations in semigroups, manuscript, 1994.

    Google Scholar 

  5. M.I. Kargapolov, J. Merzlakov, “Theory of Groups”, Nauka, Moscow, 1982.

    Google Scholar 

  6. J. Karhumäki, The Ehrenfeucht Conjecture: A compactness claim for finitely generated free semigroups, Theoretical Computer Science 29 (1984) 285–308.

    Google Scholar 

  7. J. Karhumäki, On recent trends in formal language theory, in Lect. Notes in Computer Science 267 (1987) 136–162.

    Google Scholar 

  8. J. Karhumäki, W. Plandowski, On the defect effect of many identities in free semigroups, manuscript, 1993.

    Google Scholar 

  9. J. Karhumäki, W. Plandowski, On the size of independent systems of equations in semigroups, manuscript, 1994.

    Google Scholar 

  10. J. Karhumäki, W. Plandowski, W. Rytter, Polynomial size test sets for context-free languages, JCSS (to appear).

    Google Scholar 

  11. G. Lallement, “Semigroups and Combinatorial Applications”, John Wiley and Sons, New York, 1979.

    Google Scholar 

  12. J. Lawrence, The nonexistence of finite test set for set-equivalence of finite substitutions, Bull. EATCS 28 (1986) 34–37.

    Google Scholar 

  13. M. Lothaire, “Combinatorics on Words”, Addison-Wesley Publishing Company, Massachussets, 1983.

    Google Scholar 

  14. A. de Luca, A. Restivo, On a generalization of a conjecture of Ehrenfeucht, Bull. EATCS 30 (1986) 84–90.

    Google Scholar 

  15. A.A. Muchnik, A.L. Semenov, “Jewels of Formal Languages”, (Russian translation of a book by A. Salomaa), Mir, Moscow, 1986.

    Google Scholar 

  16. L. Redei, “The Theory of Finitely Generated Commutative Semi-Groups” Oxford-Edinburgh-New York, 1965.

    Google Scholar 

  17. J.-C. Spehner, “Quelques Problemes d'Extension, de Conjugaison et de Presentation des Sous-Monoides d'Un Monoide Libre”, Phd Thesis, Universite Paris VII, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Igor Prívara Branislav Rovan Peter Ruzička

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karhumäki, J., Plandowski, W. (1994). On the size of independent systems of equations in semigroups. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_91

Download citation

  • DOI: https://doi.org/10.1007/3-540-58338-6_91

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58338-7

  • Online ISBN: 978-3-540-48663-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics