Advertisement

Some undecidability results for weakly confluent monadic string-rewriting systems

  • Friedrich Otto
Submitted Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 539)

Abstract

For a finite weakly confluent monadic string-rewriting system R presenting a group the set of valid linear sentences is decidable. Thus, many decision problems for R can be solved in a uniform way. Here we show that this is no longer true in general if R is a finite weakly confluent monadic string-rewriting system that does not present a group. In fact, we construct a system R of this form that has an undecidable word problem. Some additional undecidability results as well as some decidability results for finite weakly confluent monadic string-rewriting systems are also presented.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Autebert, L. Boasson, G. Senizergues; Groups and NTS languages; J. Comput. System Sciences 35 (1987) 243–267.Google Scholar
  2. 2.
    R.V. Book; Decidable sentences of Church-Rosser congruences; Theoretical Computer Science 24 (1983) 301–312.Google Scholar
  3. 3.
    R.V. Book; Thue systems as rewriting systems; J. Symbolic Computation 3 (1987) 39–68.Google Scholar
  4. 4.
    M. Davis; Computability and Unsolvability; McGraw-Hill: New York, 1958.Google Scholar
  5. 5.
    G. Huet; Confluent reductions: abstract properties and applications to term rewriting systems; J. Assoc. Comput. Mach. 27 (1980) 797–821.Google Scholar
  6. 6.
    K. Madlener, P. Narendran, F. Otto; A specialized completion procedure for monadic string-rewriting systems presenting groups; in: Proceedings of ICALP 91, Lect. Notes Comp. Sci., to appear.Google Scholar
  7. 7.
    K. Madlener, F. Otto; Decidable sentences for context-free groups; in: C.Choffrut, M. Jantzen (eds.), Proceedings of STACS'91, Lect.Notes Comp.Sci. 480 (1991) 160–171.Google Scholar
  8. 8.
    P. Narendran, F. Otto; Elements of finite order for finite weight-reducing and confluent Thue systems; Acta Informatica 25 (1988) 573–591.Google Scholar
  9. 9.
    F. Otto; Some undecidability results for non-monadic Church-Rosser Thue systems; Theoretical Computer Science 33 (1984) 261–278.Google Scholar
  10. 10.
    F. Otto; On deciding whether a monoid is a free monoid or is a group; Acta Informatica 23 (1986) 99–110.Google Scholar
  11. 11.
    F. Otto; When is an extension of a specification consistent? Decidable and undecidable cases; J. Symbolic Computation, to appear.Google Scholar
  12. 12.
    F. Otto, L. Zhang; Decision problems for finite special string-rewriting systems that are confluent on some congruence class; Acta Informatica, to appear.Google Scholar
  13. 13.
    L. Zhang; Weak confluence is tractable for finite monadic string-rewriting systems; manuscript, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Friedrich Otto
    • 1
  1. 1.Fachbereich Mathematik/InformatikGesamthochschule Kassel — UniversitätKasselWest Germany

Personalised recommendations