TCS School 1993: Term Rewriting pp 27-38 | Cite as
The word problem for Thue rewriting systems
Conference paper
First Online:
Abstract
This paper is divided into two parts that can be read independently. Part I is devoted to examples of undecidable Thue rewriting systems. Part II presents the results obtained so far on the conjecture that one-relation Thue systems are decidable.
Keywords
Word Problem Direct Derivation Primary Word Empty Word Markov 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.
Preview
Unable to display preview. Download preview PDF.
References
- 1.S.I. Adyan Defining relations and algorithmic problems for groups and semigroups, Tr. Mat. Inst. Steklov Akad. Nauk SSSR, 85 (1966), pp. 1–90 (Russian).Google Scholar
- 2.S.I. Adyan Transformations of words in a semigroup presented by a system of defining relations Algebra i Logika, 15 nℴ 6 (1976), pp. 611–621 (Russian)Google Scholar
- 3.S.I. Adjan and G.U. Oganesyan On the word and divisibility problems in semigroups with a single defining relation Izv. Akad. Nauk SSSR, Ser. Mat., 42 nℴ 2 (1978), pp. 219–225 (Russian)Google Scholar
- 4.S.I. Adjan and G.U. Oganesyan On the word and divisibility relation problems for semigroups with one relation Mat. Zametki, 41 nℴ 3 (1987), pp. 412–421 (Russian)Google Scholar
- 5.J. Berstel and D. Perrin Theory of codes, Academic Press, (1985)Google Scholar
- 6.J.B. Bouwsma Semigroups presented by a single relation, Doctoral Dissertation, The Pennsylvania State University, May 1993Google Scholar
- 7.G. Lallement Semigroups and Combinatorial Applications, Interscience, J. Wiley & Sons, (1979)Google Scholar
- 8.W. Magnus Das Identitätsproblem für Gruppen mit einer definierenden Relation Math. Ann., 106 (1932), pp. 295–307Google Scholar
- 9.A.A. Markov On the impossibility of certain algorithms in the theory of associative systems Dokl. Akad. Nauk SSSR, 55 (1947), pp. 587–590 and 58 (1947) pp.353–356 (Russian)Google Scholar
- 10.A.A. Markov Theory of algorithms, Tr. Mat. Inst. Akad. Nauk SSSR 42 (1956) (Russian)Google Scholar
- 11.Yu. V. Matiyasevich Simple examples of unsolvable associative calculi Dokl. Akad. Nauk SSSR, 173 nℴ 6 (1967), pp. 1264–1266 also Tr. Mat. Inst. Steklov, Akad. Nauk SSSR, 93, pp. 50–88 (Russian)Google Scholar
- 12.G.U. Oganesyan On the problems of equality and divisibility of words in a semigroup with a defining relation of the form a=bA Izv. Akad. Nauk SSSR, Ser. Mat., 42 nℴ 3, (1978), pp. 602–612 (Russian)Google Scholar
- 13.G.U. Oganesyan On semigroups with one relation and semigroups without cycles Izv. Akad. Nauk SSSR, Ser. Mat., 46 nℴ 1 (1982), pp. 84–94 (Russian)Google Scholar
- 14.E.L. Post 1947 Recursive unsolvability of a problem of Thue J. Symb. Logic, 12 (1947), pp. 1–11Google Scholar
- 15.A. Thue Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln Skr. Vid. Kristiania, I Mat. Naturv. Klasse, nℴ 10, (1914), pp. 1–34Google Scholar
- 16.G.C. Tzeitin Associative calculus with an unsolvable equivalence problem Tr. Mat. Inst. Steklov Akad. Nauk SSSR, 52, (1958), pp. 172–189 (Russian)Google Scholar
- 17.L. Zhang A short proof of a theorem of Adjan Proc. Amer. Math. Soc., 116 (1) (1992), pp. 1–3Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1995