Elements of finite order for finite monadic Church-Rosser Thue systems
HTML articles powered by AMS MathViewer
- by Friedrich Otto PDF
- Trans. Amer. Math. Soc. 291 (1985), 629-637 Request permission
Abstract:
A Thue system $T$ over $\Sigma$ is said to allow nontrivial elements of finite order, if there exist a word $u \in {\Sigma ^ \ast }$ and integers $n \ge 0$ and $k \ge 1$ such that $u \nleftrightarrow _T^ \ast \lambda$ and ${u^{n + k}} \leftrightarrow _T^ \ast {u^n}$. Here the following decision problem is shown to be decidable: Instance. A finite, monadic, Church-Rosser Thue system $T$ over $\Sigma$. Question. Does $T$ allow nontrivial elements of finite order? By a result of Muller and Schupp this implies in particular that given a finite monadic Church-Rosser Thue system $T$ it is decidable whether the monoid presented by $T$ is a free group or not.References
- Jürgen Avenhaus, Ronald V. Book, and Craig C. Squier, On expressing commutativity by finite Church-Rosser presentations: a note on commutative monoids, RAIRO Inform. Théor. 18 (1984), no. 1, 47–52 (English, with French summary). MR 750450, DOI 10.1051/ita/1984180100471 J. Avenhaus, K. Madlener and F. Otto, Groups presented by finite two-monadic Church-Rosser Thue systems, Technical Report 110/84, Department of Computer Science, University of Kaiserslautern, 1984. J. Berstel, Congruences plus que parfaites et langages algébriques, Séminaire d’Informatique Théorique, Institut de Programmation 1976-1977, pp. 123-147.
- Ronald V. Book, Confluent and other types of Thue systems, J. Assoc. Comput. Mach. 29 (1982), no. 1, 171–182. MR 662617, DOI 10.1145/322290.322301
- Ronald V. Book, When is a monoid a group? The Church-Rosser case is tractable, Theoret. Comput. Sci. 18 (1982), no. 3, 325–331. MR 662676, DOI 10.1016/0304-3975(82)90072-X
- Ronald V. Book, Decidable sentences of Church-Rosser congruences, Theoret. Comput. Sci. 24 (1983), no. 3, 301–312. MR 716826, DOI 10.1016/0304-3975(83)90005-1
- Ronald V. Book, Matthias Jantzen, and Celia Wrathall, Monadic Thue systems, Theoret. Comput. Sci. 19 (1982), no. 3, 231–251. MR 671869, DOI 10.1016/0304-3975(82)90036-6
- Ronald V. Book and Friedrich Otto, Cancellation rules and extended word problems, Inform. Process. Lett. 20 (1985), no. 1, 5–11. MR 785295, DOI 10.1016/0020-0190(85)90122-X
- Y. Cochet and M. Nivat, Une généralisation des ensembles de Dyck, Israel J. Math. 9 (1971), 389–395 (French). MR 276021, DOI 10.1007/BF02771689
- Michael A. Harrison, Introduction to formal language theory, Addison-Wesley Publishing Co., Reading, Mass., 1978. MR 526397
- John E. Hopcroft and Jeffrey D. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley Series in Computer Science, Addison-Wesley Publishing Co., Reading, Mass., 1979. MR 645539
- Gérard Lallement, On monoids presented by a single relation, J. Algebra 32 (1974), 370–388. MR 354908, DOI 10.1016/0021-8693(74)90146-X
- Gérard Lallement, Semigroups and combinatorial applications, Pure and Applied Mathematics, John Wiley & Sons, New York-Chichester-Brisbane, 1979. MR 530552
- Roger C. Lyndon and Paul E. Schupp, Combinatorial group theory, Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 89, Springer-Verlag, Berlin-New York, 1977. MR 0577064
- Wilhelm Magnus, Abraham Karrass, and Donald Solitar, Combinatorial group theory, Second revised edition, Dover Publications, Inc., New York, 1976. Presentations of groups in terms of generators and relations. MR 0422434
- A. Markov, The impossibility of algorithms for the recognition of certain properties of associative systems, Doklady Akad. Nauk SSSR (N.S.) 77 (1951), 953–956 (Russian). MR 0041802
- Andrzej Mostowski, On direct products of theories, J. Symbolic Logic 17 (1952), 1–31. MR 47574, DOI 10.2307/2267454
- David E. Muller and Paul E. Schupp, Groups, the theory of ends, and context-free languages, J. Comput. System Sci. 26 (1983), no. 3, 295–310. MR 710250, DOI 10.1016/0022-0000(83)90003-X
- Maurice Nivat, Congruences parfaites et quasi-parfaites, Séminaire P. Dubreil, 25e année (1971/72), Algèbre, Fasc. 1, Exp. No. 7, Secrétariat Mathématique, Paris, 1973, pp. 9 (French). MR 0392761
- Friedrich Otto, Conjugacy in monoids with a special Church-Rosser presentation is decidable, Semigroup Forum 29 (1984), no. 1-2, 223–240. MR 742135, DOI 10.1007/BF02573327
Additional Information
- © Copyright 1985 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 291 (1985), 629-637
- MSC: Primary 03D03; Secondary 03D40, 20F10, 68Q45
- DOI: https://doi.org/10.1090/S0002-9947-1985-0800255-1
- MathSciNet review: 800255