Complexity results for confluence problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1672, Issue , 1999, Pages 114-124

  Lohrey, Maxkus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLEXITY RESULTS; P-COMPLETE; POLYNOMIAL-TIME; PSPACE-COMPLETE; REPLACEMENT SYSTEMS; REWRITING SYSTEMS; SEMI-THUE SYSTEM; WORD PROBLEM;

POLYNOMIAL APPROXIMATION;

EID: 84949201235     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48340-3_11     Document Type: Conference Paper

References (22)

1. [BJW82] R.V. Book, M. Jantzen, and C. Wrathall. Monadic Thue systems. Theoretical Computer Science, 19:231-251, 1982.
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.
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.
4. [B081] R.V. Book and C.P. O'Dunlaing. Testing for the Church-Rosser property (note). Theoretical Computer Science, 16:223-229, 1981.
5. [B085] R.V. Book and F. Otto. Cancellation rules and extended word problems. Information Processing Letters, 20:5-11, 1985.
6. [B093] R.V. Book and F. Otto. String-Rewriting Systems. Springer, 1993.
7. [Boo82] R.V. Book. Confluent and other types of Thue systems. Journal of the ACM, 29(1):171-182, January 1982.
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.
9. [Die90] V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1990.
10. [DR95] V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
11. [GHR95] R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995.
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.
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.
14. 3) algorithm for testing the Church-Rosser property of Thue systems. Theoretical Computer Science, 35(1):109-114, January 1985.
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.
16. [Loh99] M. Lohrey. Complexity results for confluence problems. Technical Report 1999/05, University of Stuttgart, Germany, 1999. Available via ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart-fi/TR-1999-0E
17. [Maz77] A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
18. [NB72] M. Nivat and M. Benois. Congruences parfaites et quasi-parfaites. Semi- naire Dubreil, 25(7-01-09), 1971-1972.
19. [N088] 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.
20. [Och85] E. Ochmański. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science (EATCS), 27:5667, October 1985.
21. [Pap94] C.H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
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.