Word problems and confluence problems for restricted semi-thue systems

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

Volumn 1833, Issue , 2000, Pages 172-186

  Lohrey, Markus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MEMBERSHIP PROBLEM; REDUCING SYSTEMS; SEMI-THUE SYSTEM; WORD PROBLEM;

CONTEXT SENSITIVE GRAMMARS;

EID: 84937403815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10721975_12     Document Type: Conference Paper

References (32)

1. R. Book, M. Jantzen, B. Monien, C. P. O’Dunlaing, and C. Wrathall. On the complexity of word problems in certain Thue systems. In J. Gruska and M. Chytil, editors, Proceedings of the 10rd Mathematical Foundations of Computer Science (MFCS’81), Strbske Pleso (Czechoslovakia), number 118 in Lecture Notes in Computer Science, pages 216-223. Springer, 1981.
2. G. Buntrock and K. Lorys. On growing context-sensitive languages. In W. Kuich, editor, Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP 92), Vienna (Austria), number 623 in Lecture Notes in Computer Science, pages 77-88. Springer, 1992.
3. G. Buntrock and K. Lorys. The variable membership problem: Succinctness versus complexity. In P. Enjalbert, E. W. Mayr, and K. W. Wagner, editors, Proceedings of the11th Annual Symposium on Theoretical Aspects of Computer Science (STACS 94), Caen (France), number 775 in Lecture Notes in Computer Science, pages 595-606. Springer, 1994.
4. R.V. Book and C. P. O’Dunlaing. Testing for the Church-Rosser property (note). Theoretical Computer Science, 16:223-229, 1981.
5. G. Bauer and F. Otto. Finite complete rewriting systems and the complexity of the word problem. Acta Informatica, 21:521-540, 1984.
6. R.V. Book and F. Otto. String-Rewriting Systems. Springer, 1993.
7. R.V. Book. Confluent and other types of Thue systems. Journal of the Association for Computing Machinery, 29(1):171–182, 1982.
8. E. W. Cardoza. Computational complexity of the word problem for commutative semigroups. Technical Report MAC Technical Memorandum 67, MIT, 1975.
9. S. Cho and D. T. Huynh. The complexity of membership for deterministic growing context-sensitive grammars. International Journal of Computer Mathematics, 37:185-188, 1990.
10. V. Diekert. Some properties of weight-reducing presentations. Report TUM-I8710, Technical University Munich, 1987.
11. V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer, 1990.
12. E. Dahlhaus and M. K. Warmuth. Membership for growing context-sensitive grammars is polynomial. Journal of Computer and System Sciences, 33:456-472, 1986.
13. D. T. Huynh. Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is Scomplete. Theoretical Computer Science, 33:305-326, 1984.
14. D. T. Huynh. Complexity of the word problem for commutative semigroups of fixed dimension. Acta Informatica, 22:421-432, 1985.
15. D. T. Huynh. The complexity of the membership problem for two subclasses of polynomial ideals. SIAM Journal on Computing, 15(2):581–594, 1986.
16. M. Jantzen. Confluent string rewriting. In EATCS Monographs on theoretical computer science, volume 14. Springer, 1988.
17. D. E. Knuth and P. B. Bendix. Simple Word Problems in Universal Algebras. In J. Leech, editor, Computational Problems in Abstact Algebras, pages 263-297. Pergamon Press, Elmsford N.Y., 1967.
18. D. Kapur, M. S. Krishnamoorthy, R. McNaughton, and P. Narendran. An 0(|T|) algorithm for testing the Church-Rosser property of Thue systems. Theoretical Computer Science, 35(1):109–114, 1985.
19. D. Kapur and P. Narendran. The Knuth-Bendix completion procedure and Thue systems. SIAM Journal on Computing, 14(3):1052–1072, 1985.
20. K. Krithivasan and P. Narendran. On the membership problem for some grammars. Technical Report CS-TR-1787, University of Maryland, 1987.
21. M. Lohrey. Complexity results for confluence problems. In M. Kutylowski and L. Pacholski, editors, Proceedings of the 24th International Sympo sium on Mathematical Foundations of Computer Science (MFCS’99), Szk- larska Poreba (Poland), number 1672 in Lecture Notes in Computer Sci ence, pages 114–124. Springer, 1999.
22. A. Markov. On the impossibility of certain algorithms in the theory of associative systems. Doklady Akademii Nauk SSSR, 55, 58:587–590, 353–356, 1947.
23. E. W. Mayr and A. R. Meyer. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathemat ics, 46:305–329, 1982.
24. R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. Journal of the Association for Computing Machinery, 35(2):324–344, 1988.
25. M. Nivat and M. Benois. Congruences parfaites et quasi–parfaites. Sem-inaire Dubreil, 25(7–01–09), 1971–1972.
26. M. H. A. Newman. On theories with a combinatorial definition of “equivalence”. Annals Mathematics, 43:223–243, 1943.
27. P. Narendran and F. Otto. Elements of finite order for finite weigth-reducing and confluent Thue systems. Acta Informatica, 25:573–591, 1988.
28. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
29. E. Post. Recursive unsolvability of a problem of Thue. Journal of Symbolic Logic, 12(1):1–11, 1947.
30. I. H. Sudborough. On the tape complexity of deterministic context– free languages. Journal of the Association for Computing Machinery, 25(3):405–414, 1978.
31. R. M. Verma, M. Rusinowitch, and D. Lugiez. Algorithms and reductions for rewriting problems. In Proceedings of the 9th Conference on Rewriting Techniques and Applications (RTA-98), Tsukuba (Japan), number 1379 in Lecture Notes in Computer Science, pages 166–180. Springer, 1998.
32. J. von Zur Gathen and M. Sieveking. A bound on solutions of linear integer equalities and inequalities. Proceedings of the American Mathematical Society, 72(1):155–158, 1978.