Complexity Results for Confluence Problems

  • Markus Lohrey
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1672)


We study the complexity of the confluence problem for restricted kinds of semi-Thue systems, vector replacement systems and general trace rewriting systems. We prove that confluence for length-reducing semi-Thue systems is P-complete and that this complexity reduces to NC2 in the monadic case. For length-reducing vector replacement systems we prove that the confluence problem is PSPACE-complete and that the complexity reduces to NP and P for monadic systems and special systems, respectively. Finally we prove that for special trace rewriting systems, confluence can be decided in polynomial time and that the extended word problem for special trace rewriting systems is undecidable.


Polynomial Time Word Problem Critical Pair Special Trace Thue System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BJW82]
    R.V. Book, M. Jantzen, and C. Wrathall. Monadic Thue systems. Theoretical Computer Science, 19:231–251, 1982.MATHCrossRefMathSciNetGoogle Scholar
  2. [BL81]
    A. M. Ballantyne and D. S. Lankford. New decision algorithms for finitely presented commutative semigroups. Comput. and Maths. with Appls., 7:159–165, 1981.CrossRefMathSciNetGoogle Scholar
  3. [BMS89]
    A. Bertoni, G. Mauri, and N. Sabadini. Membership problems for regular and context free trace languages. Information and Computation, 82:135–150, 1989.MATHCrossRefMathSciNetGoogle Scholar
  4. [BO81]
    R.V. Book and C.P. O’Dunlaing. Testing for the Church-Rosser property (note). Theoretical Computer Science, 16:223–229, 1981.MATHCrossRefMathSciNetGoogle Scholar
  5. [BO85]
    R.V. Book and F. Otto. Cancellation rules and extended word problems. Information Processing Letters, 20:5–11, 1985.MATHCrossRefMathSciNetGoogle Scholar
  6. [BO93]
    R.V. Book and F. Otto. String-Rewriting Systems. Springer, 1993.Google Scholar
  7. [Boo82]
    R.V. Book. Confluent and other types of Thue systems. Journal of the ACM, 29(1):171–182, January 1982.MATHCrossRefMathSciNetGoogle Scholar
  8. [CP85]
    R. Cori and D. Perrin. Automates et commutations partielles. R.A.I.R.O. — Informatique Théorique et Applications, 19:21–32, 1985.MATHMathSciNetGoogle Scholar
  9. [Die90]
    V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1990.MATHGoogle Scholar
  10. [DR95]
    V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.Google Scholar
  11. [GHR95]
    R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995.Google Scholar
  12. [JLL77]
    N. D. Jones, L. H. Landweber, and Y. E. Lien. Complexity of some problems in Petri nets. Theoretical Computer Science, 4:277–299, 1977.MATHCrossRefMathSciNetGoogle Scholar
  13. [Kar72]
    R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, New York, 1972.Google Scholar
  14. [KKMN85]
    D. Kapur, M. S. Krishnamoorthy, R. McNaughton, and P. Narendran. An O(|T|3) algorithm for testing the Church-Rosser property of Thue systems. Theoretical Computer Science, 35(1):109–114, January 1985.MATHCrossRefMathSciNetGoogle Scholar
  15. [Loh98]
    M. Lohrey. On the confluence of trace rewriting systems. In V. Arvind and R. Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science, volume 1530 of Lecture Notes in Computer Science, pages 319–330. Springer, 1998.Google Scholar
  16. [Loh99]
    M. Lohrey. Complexity results for confluence problems. Technical Report 1999/05, University of Stuttgart, Germany, 1999. Available via Scholar
  17. [Maz77]
    A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.Google Scholar
  18. [NB72]
    M. Nivat and M. Benois. Congruences parfaites et quasi-parfaites. Seminaire Dubreil, 25(7-01–09), 1971–1972.Google Scholar
  19. [NO88]
    P. Narendran and F. Otto. Preperfectness is undecidable for Thue systems containing only length-reducing rules and a single commutation rule. Information Processing Letters, 29:125–130, 1988.MATHCrossRefMathSciNetGoogle Scholar
  20. [Och85]
    E. Ochmański. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science (EATCS), 27:56–67, October 1985.Google Scholar
  21. [Pap94]
    C.H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.Google Scholar
  22. [VRL98]
    R. M. Verma, M. Rusinowitch, and D. Lugiez. Algorithms and reductions for rewriting problems. In Proceedings 9th Conference on Rewriting Techniques and Applications, Tsukuba (Japan), volume 1379 of Lecture Notes in Computer Science, pages 166–180. Springer, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Markus Lohrey
    • 1
  1. 1.Institut für InformatikUniversität StuttgaxtStuttgartGermany

Personalised recommendations