A characterization of even Linear Languages and its application to the learning problem
Even Linear Language class is a subclass of context-free class. In this work we propose a characterization of this class using a relation of finite index. Theorems are provided in order to prove the consistence of the characterization. Finally, we propose a method to learn this class using a reduction to the problem of learning regular languages.
Unable to display preview. Download preview PDF.
- M. Gold Language Identification in the Limit. Information and Control 10, pp 447–474. 1967.Google Scholar
- J. Hopcroft, J. Ullman Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company. 1979.Google Scholar
- J. Oncina, P. García Inferring regular languages in polinomial update time. Pattern Recognition and Image Analysis. Selected Papers from the IVth Spanish Symposium. Series in Machine Perception Artificial Intelligence. Vol. 1. World Scientific. 1992.Google Scholar
- B. Trakhtenbrot, Y. Barzdin Finite Automata: Behavior and Synthesis. North Holland Publishing Company. 1973.Google Scholar