Learning k-piecewise testable languages from positive data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1147, Issue , 1996, Pages 204-210

  Ruiz, José ^a   García, Pedro ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; POLYNOMIAL APPROXIMATION;

K-PIECEWISE TESTABLE LANGUAGES; PAC LEARNING; POLYNOMIAL TIME COMPLEXITY; POSITIVE DATA; SUBWORDS;

COMPUTATIONAL LINGUISTICS;

EID: 84875570436     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0033355     Document Type: Conference Paper

References (17)

1. Angluin, D. Inductive inference of formal languages from positive data. Information and Control, 45. pp. 117-135, 1980.
2. Angluin, D, Inference of reversible languages. Journal of the ACM 29 (3). pp. 741-765, 1982.
3. Anthony, M. and Biggs, N. Computational Learning Theory. An Introduction. Cambridge University Press, 1991.
4. Biermann A.W. and Feldman, J.A. On the synthesis of finite state machines from samples of their behavior. IEEE Trans. on Computers, Vol. C-21 pp. 592-597, 1972.
5. Brzozowski, J.A. and Simon, I. Characterizations of Locally Testable Events. Discrete Mathematics, 4. pp. 243-271. 1973.
6. Fu, K.S. Syntactic Pattern Recognition and Applications. Prentice Hall, 1982.
7. P. Garcla and E. Vidal. Inference of k-testable Languages in the Strict Sense and application to Syntactic Pattern Recognition. IEEE Trans. Pattern Analysi s and Machine Intelligence, Vol. PAMI-12 pp.920-925, 1990.
8. Gold, E.M. Language identification in the limit. Information and Control, 10. pp. 447-474, 1967.
9. González R.C. and Thomasod, M.G. Syntactic Pattern Recognition: An Introduction. Addison Wesley, 1978.
10. Knuutila, T. How to invent eharacterizable methods for regular languages. Lecture Notes in Computer Science 744, Springer Verlag, pp. 209-222, 1993.
11. Lothaire, M. Combinatories on words. Addison Wesley,1983.
12. Muggleton, S. Inductive Acquisition of Expert Knowledge. Addison-Wesley, 1990.
13. Natarajan, B. Machine Learning: A theoretical aproach. Morgan Kaufmann P. Inc.1991.
14. Pin, J.E. Variétés de langages formels. Masson, 1984.
15. Radhakrisnan, V. and Nagaraja, G. Inference of regular grammars via skeletons. IEEE Trans. System, Man, and Cybernetics, SCM-17. pp. 982-992, 1987.
16. Shyam Kaput and Gianfranco Bilardi Language learning without overgeneralization. Theoretical Computer Science 141, pp. 151-162, 1995.
17. Simon, I. Pieeewise testable events. Lecture Notes in Computer Science, vol. 33, Springer Verlag, pp. 214-222, 1980.