Abstract
The aim of this paper is to define a new family of regular languages, the Locally Threshold Testable Languages in Strict Sense (LTTSS). This family includes the well known family of locally testable languages in strict sense (LTSS) and is included in the family of locally threshold testable languages (LTT). Membership of a word to a LTTSS language can be decided by means of local scanning, using a sliding window of a fixed length k, although in this case, we have to care that the number of occurrences of certain segments of length ≤ k in the words is not greater than a level of restriction, less than a threshold r. As LTTSS languages may be of interest in disciplines such as Pattern Recognition and specially in Speech Recognition, an inference algorithm that identifies the family of (k,r)-TTSS languages from positive data in the limit is proposed. Finally we also report some results aiming to reflect the evolution of the behavior of this algorithm for different values of k and r when it is used in a handwritten digits recognition task.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Amengual, J.C. and Vidal E. Two different approaches for Cost-efficient Viterbi Parsing with Error Correction. LCNS (1121): Advances in Structural and Syntactic Pattern Recognition. Percier, Wang and Rosenfeld (Eds.) Springer Verlag, pp 30–39, 1996.
Angluin, D. Inductive inference of formal languages from positive data. Information and Control, 45. pp. 117–135, 1980.
Angluin, D. Inference of reversible languages. Journal of the ACM 29 (3). pp. 7741–765, 1982.
Biermann A.W. and Feldman, J.A. On the synthesis of finite state machines from samples of their behavior. IEEE Trans. on Computers, C-21:592–597, 1972.
Fu, K. S. Syntactic Pattern Recognition and Applications. Prentice Hall, 1982.
García, P. and Ruiz, J. Locally Threshold Testable Languages in Strict Sense. Research Report DSIC-II/36/96. Univ Politécnica de Valencia. 1996.
García, P. and Vidal, E. Inference of k-testable Languages in the Strict Sense and application to Syntactic Pattern Recognition. IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. PAMI-12 pp.920–925, 1990.
Gold, E.M. Language identification in the limit. Information and Control, 10. pp. 447–474, 1967.
González R.C. and Thomason, M.G. Syntactic Pattern Recognition: An Introduction. Addison Wesley, 1978.
Hopcroft, J. Ullman, J. Introduction to Automata theory, Languages and Computation. Addison-Wesley. 1979.
Kapur, S. and Bilardi, G. Language learning without overgeneralization. Theoretical Computer Science 141, pp. 151–162, 1995.
Medvedev, Y. T. On the Class of Events Representable in a Finite Automaton. Sequential Machines-Selected Papers, ed. E. F. Moor, Addison-Wesley, pp.227–315, 1964.
Ruiz, J. and García, P. Learning k-Piecewise Testable Languages from Positive Data. Proc. of the 3rd Intern. Conference on Grammatical Inference. LNCS 1147 Springer Verlag, pp. 203–210. 1996.
Vidal, E., Casacuberta, F and García, P. Grammatical Inference and Automatic Speech Recognition. In Speech Recognition and Coding. Springer Verlag, pp.175–191. 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruiz, J., España, S., García, P. (1998). Locally threshold testable languages in strict sense: Application to the inference problem. In: Honavar, V., Slutzki, G. (eds) Grammatical Inference. ICGI 1998. Lecture Notes in Computer Science, vol 1433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054072
Download citation
DOI: https://doi.org/10.1007/BFb0054072
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64776-8
Online ISBN: 978-3-540-68707-8
eBook Packages: Springer Book Archive