This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Book. Confluent and other types of Thue systems. J. Assoc. Comput. Mach., vol. 29 (1982), 171–182.
R. Book and C. O'Dunlaing. Testing for the Church-Rosser property. Theoret. Comput. Sci., vol. 16 (1981), 216–223.
N. Dershowitz and J.-P. Jouannaud. Rewrite Systems, Chapter 6 in J. Van Leeuwen (ED.), Formal Models and Semantics, Handbook of Theoretical Computer Science, vol. B, Elsevier, (1990) 243–320.
G. Huet. Confluent Reductions: Abstract properties and applications to term rewriting systems. J. Assoc. Comput. Mach., vol. 27, (1980) 797–821.
M. Jantzen. Confluent Thue Systems. Springer-Verlag (1988).
K. Madlener and F. Otto. Pseudo-natural algorithms for decision problems in certain types of string-rewriting systems. J. Symbolic Computation, vol. 1 (1985), 383–418.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Book, R.V. (1992). A note on confluent Thue systems. In: Schulz, K.U. (eds) Word Equations and Related Topics. IWWERT 1990. Lecture Notes in Computer Science, vol 572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55124-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-55124-7_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55124-9
Online ISBN: 978-3-540-46737-3
eBook Packages: Springer Book Archive