Preview
Unable to display preview. Download preview PDF.
References
ANGLUIN, D. “Inference of reversible languages”. Journal of the ACM, 29(3), 741–765, 1982.
GARCÍA, P. & VIDAL, E. (1990) “Inference of k-Testable Languages in the Strict Sense and Application to Syntactic Pattern Recognition”. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-12(9), 920–925
GARCíA, P. (1993) “Learning K-Testable Tree Sets from positive data”. Internal Report, U. P. Valencia DSIC-II/46/93.
GÉCSEG, F., STEINBY, M. (1984) “Tree automata”. Akadémiai Kiadó, Budapest.
MÄKINEN ERKKI (1992) “On the structural grammatical inference problem for some classes of context-free grammars”, Information Processing Letters 42, 1–5. North-Holland.
MC NAUGHTON, R. “Algebraic decision procedures for local testability” Mathematics Systems Theory, 8(1), 60–76, 1974.
SAKAKIBARA, Y. (1992) “Efficient Learning of Context-Free Grammars from Positive Structural Examples”, Information and Computation 97, 23–60.
WOLFRAM, S. “Mathematica, a system for doing Mathematics by computer”, Addison Wesley, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruiz, J., García, P. (1994). The algorithms RT and k-TTI: A first comparison. In: Carrasco, R.C., Oncina, J. (eds) Grammatical Inference and Applications. ICGI 1994. Lecture Notes in Computer Science, vol 862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58473-0_147
Download citation
DOI: https://doi.org/10.1007/3-540-58473-0_147
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58473-5
Online ISBN: 978-3-540-48985-6
eBook Packages: Springer Book Archive