Recognition and learning of a class of context-sensitive languages described by augmented regular expressions

Pattern Recognition

Volumn 30, Issue 1, 1997, Pages 163-182

  Alquézar, René ^a,b   Sanfeliu, Alberto ^a,b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b CSIC Instituto de Cibernetica de Barcelona   (Spain)

Author keywords

Context sensitive languages; Finite automata; Formal languages; Grammatical inference; Learning; Parsing; Regular expressions; Syntactic pattern recognition

Indexed keywords

CONSTRAINT THEORY; CONTEXT SENSITIVE GRAMMARS; CONTEXT SENSITIVE LANGUAGES; FINITE AUTOMATA; LEARNING ALGORITHMS; MATHEMATICAL TRANSFORMATIONS;

GRAMMATICAL INFERENCE;

CHARACTER RECOGNITION;

EID: 0030736036     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(96)00056-8     Document Type: Article

References (30)

1. E. Tanaka, Theoretical aspects of syntactic pattern recognition, Pattern Recognition 28, 1053-1061 (1995).
2. K. S. Fu, Syntactic Pattern Recognition and Applications. Prentice-Hall, New York (1982).
3. H. Bunke and A. Sanfeliu (eds), Syntactic and Structural Pattern Recognition: Theory and Applications. World Scientific, Singapore (1990).
4. A. Salomaa, Formal Languages. Academic Press, New York (1973).
5. J. E. Hopfcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading MA (1979).
6. W.A. Woods, Transition networks grammars for natural language analysis, CACM 13, 591-606 (1970).
7. S. M. Chou and K. S. Fu, Inference for transition network grammars, Proc. Int. Joint Conf. on Pattern Recognition, 3, CA, pp. 79-84 (1976).
8. D. Angluin, Finding patterns common to a set of strings, J. Comput. System Sci. 21, 46-62 (1980).
9. A. Marron and K. Ko, Identification of pattern languages from examples and queries, Inform. Computation 74, 91-112 (1987).
10. Z. Kohavi, Switching and Finite Automata Theory, (2nd edition). Tata McGraw-Hill, New Delhi, India (1978).
11. D. N. Arden, Delay logic and finite state machines, Proc. Second Ann. Symp. on Switching Theory and Logical Design, 133-151 (1961).
12. R. Alquézar and A. Sanfeliu, Augmented regular expressions: a formalism to describe, recognize, and learn a class of context-sensitive languages, Research Report LSI-95-17R, Universitat Politecnica de Catalunya, Spain (1995).
13. L. Miclet, Inference of regular expressions, Proc. 3rd Int. Conf. on Pattern Recognition 100-105 (1976).
14. L. Miclet, Grammatical inference, in Syntatic and Structural Pattern Recognition: Theory and Applications, H. Bunke and A. Sanfeliu, eds. World Scientific, Singapore (1990).
15. R. C. Carrasco and J. Oncina (eds), Grammatical Inference and Applications, Proc. of the Second Int. Colloquium, ICGI'94, Alicante, Spain, Springer-Verlag, Lecture Notes in Artificial Intelligence 862, (1994).
16. J. Gregor, Data-driven inductive inference of finite-state automata, Int. J. of Pattern Recognition and Artificial Intell. 8(1), 305-322 (1994).
17. D. Angluin and C.H. Smith, Inductive inference: Theory and methods, ACM Computing Survey 15(3), 237-269 (1983).
18. E.M. Gold, Language identification in the limit, Inform. Control 10, 447-474 (1967).
19. M. Kudo and M. Shimbo, Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships, Pattern Recognition 21, 401-409 (1988).
20. E.M. Gold, Complexity of automaton identification from given data, Inform. Control 37, 302-320 (1978).
21. J. Oncina and P. Garcia, Identifying regular languages in polynomial time, in Advances in Structural and Syntactic Pattern Recognition, H. Bunke, ed. World-Scientific, Singapore, pp. 99-108 (1992).
22. R. Alquézar and A. Sanfeliu, Incremental grammatical inference from positive and negative data using unbiased finite state automata, in Shape, Structure and Pattern Recogniton, Proc. Int. Workshop SSPR'94, Nahariya, Israel, D. Dori and A. Bruckstein, eds, World Scientific Pub., Singapore, pp. 291-300 (1995).
23. C.L. Giles, C.B. Miller, D. Chen, H.H. Chen, G.Z. Sun and Y.C. Lee Learning and extracting finite state automata with second-order recurrent neural networks, Neural Computation 4, 393-405 (1992).
24. A. Sanfeliu and R. Alquézar, Active grammatical inference: a new learning methodology, in Shape, Structure and Pattern Recogniton, Proc. Int. Workshop SSPR'94, Nahariya, Israel, D. Dori and A. Bruckstein, eds. World Scientific Pub., Singapore, 191-200 (1995).
25. R. Alquézar and A. Sanfeliu, An algebraic framework to represent finite-state machines in single-layer recurrent neural networks, Neural Computation, 7, 931-949 (1995).
26. V. Radhakrishnan and G. Nagaraja, Inference of even linear grammars and its application to picture description languages, Pattern Recognition 21, 55-62 (1988).
27. Y. Takada, Grammatical inference for even linear languages based on control sets, Inform. Process. Lett. 28(4), 193-199 (1988).
28. Y. Sakakibara, Efficient learning of context-free grammars from positive structural examples, Inform. Computation 97, 23-60 (1992).
29. P. Garcia and J. Oncina, Learning general context-free grammars from positive structural samples and negative strings, DSIC Research Report, Universidad Politecnica de Valencia, Spain (1993).
30. Y. Takada, A hierarchy of language families learnable by regular language learners, in Grammatical Inference and Applications, Proc. of the Second Int. Colloquium, ICGI'94, Alicante, Spain, R. C. Carrasco and J. Oncina, eds. Springer-Verlag, Lecture Notes in Artificial Intelligence, 862, 16-24 (1994).