Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1981: Mathematical Foundations of Computer Science 1981 pp 216–223Cite as

On the complexity of word problems in certain Thue systems

Preliminary report

  • Communications
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Book, Confluent and other types of Thue systems, J. Assoc. Comput. Mach., to appear.

    Google Scholar 

  2. R. Book, The undecidability of a word problem: on a conjecture of Strong, Maggiolo-Schettini, and Rosen, Info. Proc. Letters, to appear.

    Google Scholar 

  3. R. Book, M. Jantzen, and C. Wrathall, Monadic Thue systems, Theoret. Comp. Sci., to appear.

    Google Scholar 

  4. R. Book and C. Ó'Dúnlaing, Testing for the Church-Rosser property, Theoret. Comp. Sci., to appear.

    Google Scholar 

  5. A. Ehrenfeucht and G. Rozenberg, On the emptiness of the intersection of two DOS-languages problem, Info. Proc. Letters 10 (1980), 223–225.

    Google Scholar 

  6. G. Huet, Confluent reductions: abstract properties and applications to term-rewriting systems, J. Assoc. Comput. Mach. 27 (1980), 797–821.

    Google Scholar 

  7. H. Lewis and C. Papadimitrio, Symmetric space-bounded computation, Automata, Languages, and Programming, Lecture Notes in Computer Science 85 (1980), 374–384.

    Google Scholar 

  8. M. Nivat (with M. Benois), Congruences parfaites et quasiparfaites, Seminaire Dubreil, 25e Année (1971–72), 7-01-09.

    Google Scholar 

  9. R. Strong, A. Maggiolo-Schettini, and R. Rosen, Recursion structure simplification, SIAM J. Computing 4 (1975), 307–320.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California, 93106, Santa Barbara, Ca, U.S.A.

    R. Book, C. Ó'Dúnlaing & C. Wrathall

  2. Fachbereich Informatik, Universität Hamburg, D-2000, Hamburg 13, West Germany

    M. Jantzen

  3. Fachbereich Mathematik-Informatik, Universität Paderborn, 4790, Paderborn, West Germany

    B. Monien

Authors
  1. R. Book
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Jantzen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. C. Ó'Dúnlaing
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. C. Wrathall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Book, R., Jantzen, M., Monien, B., Ó'Dúnlaing, C., Wrathall, C. (1981). On the complexity of word problems in certain Thue systems. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_87

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_87

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation