Abstract
Tree rewriting systems are sets of tree rewriting rules used to compute by repeatedly replacing equal trees in a given formula until the simplest possible form (normal form) is obtained. The Church-Rosser property is certainly one of the most fundamental properties of tree rewriting system. In this system the simplest form of a given tree is unique since the final result does not depend on the order in which the rewritings rules are applied. The Church-Rosser system can offer both flexible computing and effecting reasoning with equations and have been intensively researched and widely applied to automated theorem proving and program verification etc. [3,5].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Learning regular sets from queries and counter examples. Inform. Comput. 75, 87–106 (1987)
Besombes, J., Marion, J.Y.: Learning tree languages from positive examples and membership queries. Theoretical Computer Science 382, 183–197 (2007)
Gallier, J.H., Book, R.V.: Reductions in tree replacement systems. Theoretical Computer Science 37, 123–150 (1985)
Gold, M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Rosen, B.K.: Tree-manipulating systems and Church-Rosser theorems. Journal of the Association for Computing Machinery 20(1), 160–187 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jayasrirani, M., Thomas, D.G., Nagar, A.K., Robinson, T. (2010). Learning of Church-Rosser Tree Rewriting Systems. In: Sempere, J.M., GarcÃa, P. (eds) Grammatical Inference: Theoretical Results and Applications. ICGI 2010. Lecture Notes in Computer Science(), vol 6339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15488-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-15488-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15487-4
Online ISBN: 978-3-642-15488-1
eBook Packages: Computer ScienceComputer Science (R0)