Skip to main content
SpringerLink
Log in

Burnside monoids word problem and the conjecture of Brzozowski

  • Conference paper
  • First Online:
Term Rewriting (TCS School 1993)

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

Included in the following conference series:

  • 175 Accesses

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. Brzozowski, K. Culik, and A. Gabrielian. Classification of non-counting events. J. Comp. Syst. Sci., 5:41–53, 1971.

    Google Scholar 

  2. J. Brzozowski. Open problems about regular languages. In R. V. Book, editor, Formal Language Theory, Perspectives and Open Problems, pages 23–47. Academic Press, New York, 1980.

    Google Scholar 

  3. N. Dershowitz. Rewriting methods for word problems. In M. Ito, editor, Words, Languages and Combinatorics, pages 104–118, World Scientific, 1990.

    Google Scholar 

  4. V. S. Guba. The word problem for the free semigroup satisfaying T m=Tm+n with m≥4 or m=3, n=1. Int. J. of Algebra and Computation, Vol. 3, No. 2 (1993) 125–140.

    Google Scholar 

  5. V. S. Guba. The word problem for the free semigroup satisfaying T m=Tm+n with m≥3. Int. J. of Algebra and Computation, Vol. 3, No. 3 (1993) 335–347.

    Google Scholar 

  6. A. Pereira do Lago. Sobre os semigroupos de Burnside x n=xn+m. Master's thesis, Universidade de São Paulo, November 1991.

    Google Scholar 

  7. A. de Luca and S. Varrichio. On non-counting regular classes. In M. S. Patersen, editor, Automata, Languages and Programming, volume 443 of Lecture Notes in Computer Science, pages 74–87. Springer-Verlag, 1990.

    Google Scholar 

  8. E. Hotzel. On finiteness conditions in semigroups. Journal of Algebra, 60:352–370, 1979.

    Google Scholar 

  9. J. M. Howie. An introduction to semigroup theory. Academic Press, London, 1976.

    Google Scholar 

  10. J. McCammond. The solution of the word problem for the relatively free semigroups satisfying t a=ta+b with a≥6. Int. J. of Algebra and Computation, Vol. 1, No. 1 (1991) 1–32.

    Google Scholar 

  11. J.-F. Rey. Semigroupes de Burnside et Conjecture de Brzozowski. Rapport technique I.B.P.-L.I.T.P. 92.57, Paris, juillet 1992.

    Google Scholar 

  12. J. E. Pin. Variétés de langages formels. études et recherches en informatique. Masson, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBP-LITP, Université Paris VI, 4, place Jussieu, 75252, Paris Cedex 05

    Jean-François Rey

Authors
  1. Jean-François Rey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hubert Comon Jean-Pierre Jounnaud

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rey, JF. (1995). Burnside monoids word problem and the conjecture of Brzozowski. In: Comon, H., Jounnaud, JP. (eds) Term Rewriting. TCS School 1993. Lecture Notes in Computer Science, vol 909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59340-3_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-59340-3_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59340-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation