This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Avenhaus and K. Madlener, On groups defined by monadic Thue systems, Colloquium on Algebra, Combinatorics, and Logic in Computer Science, Györ, Hungary, Sept. 1983.
J. Avenhaus, K. Madlener and F. Otto, Groups presented by finite two-monadic Church-Rosser Thue systems, Technical Report 110/84, Fachbereich Informatik, Universität Kaiserslautern, 1984.
R.V. Book, Confluent and other types of Thue systems, Journal ACM 29 (1982), 171–182.
R.V. Book, When is a monoid a group ? The Church-Rosser case is tractable, Theoret. Comput. Sci. 18 (1982), 325–331.
R.V. Book, Decidable sentences of Church-Rosser congruences, Theoret. Comput. Sci. 24 (1983), 301–312.
R.V. Book and C. O'Dunlaing, Thue congruences and the Church-Rosser property, Semigroup Forum 22 (1981), 325–331.
R.V. Book and C. O'Dunlaing, Testing for the Church-Rosser property, Theoret. Comput. Sci. 16 (1981), 223–229.
R.V. Book and F. Otto, Cancellation rules and extended word problems, Inf. Proc. Letters 20 (1985), 5–11.
Y. Cochet, Church-Rosser congruences on free semigroups, Coll. Math. Soc. Janos Bolyai: Algebraic Theory of Semigroups 20 (1976), 51–60.
R.H. Gilman, Computations with rational subsets of confluent groups, Proceedings of EUROSAM 1984, LNCS 174 (1984), 207–212.
R.H. Haring-Smith, Groups and simple languages, Transactions of the Amer. Math. Soc. 279 (1983), 337–356.
J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
D. Kapur, M. Krishnamoorthy, R. Mc Naughton and P. Narendran, An O (|T|3) algorithm for testing the Church-Rosser property of Thue systems, Theoret. Comput. Sci. 35 (1985), 109–114.
G. Lallement, Semigroups and combinatorial applications, Wiley-Interscience, 1979.
W. Magnus, A. Karrass and D. Solitar, Combinatorial group theory, 2nd revised edition, Dover, N.Y., 1976.
A. Markov, Impossibility of algorithms for recognizing some properties of associative systems, Dokl. Akad. Nauk SSSR 77 (1951), 953–956.
A. Mostowski, Review of [16], J. Symbolic Logic 17 (1952), 151–152.
D.E. Muller and P.E. Schupp, Groups, the theory of ends, and context-free languages, J. Comput. Sys. Sci. 26 (1983), 295–310.
P. Narendran, Church-Rosser and related Thue systems, Ph.D. Dissertation, Rensselaer Polytechnic Institute, 1983. Also appears as Report No. 84 CRD 176, General Electric Corporate Research and Development, Schenectady, N.Y., 1984.
P. Narendran and F. Otto, Complexity results on the conjugacy problem for monoids, Theoret. Comput. Sci., 35 (1985), 227–243.
F. Otto, Elements of finite order for finite monadic Church-Rosser Thue systems, Transact. of the AMS, to appear.
F. Otto, Church-Rosser Thue systems that present free monoids, SIAM J. on Comput., to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Otto, F. (1985). Deciding algebraic properties of monoids presented by finite church-rosser Thue systems. In: Jouannaud, JP. (eds) Rewriting Techniques and Applications. RTA 1985. Lecture Notes in Computer Science, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15976-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-15976-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15976-6
Online ISBN: 978-3-540-39679-6
eBook Packages: Springer Book Archive