A method to infer a subclass of linear languages from positive structural information (i.e. skeletons) is presented. The characterization of the class and the analysis of the time and space complexity of the algorithm is exposed too. The new class, Terminal and Structural Distinguishable Linear Languages (TSDLL), is defined through an algebraic characterization and a pumping lemma. We prove that the proposed algorithm correctly identifies any TSDL language in the limit if structural information is presented. Furthermore, we give a definition of a characteristic structural set for any target grammar. Finally we present the conclusions of the work and some guidelines for future works.
Formal languages grammatical inference characterizable methods structural information
This is a preview of subscription content, log in to check access.
E. MÄkinenA note on the grammatical inference problem for even linear languages. Fundamenta Informaticae 25, No. 2 (1996) 175–181.zbMATHMathSciNetGoogle Scholar
V. RadhakrishnanGrammatical Inference from Positive Data: An Effective Integrated Approach. Ph.D. Thesis. Department of Computer Science and Engineering. HT Bombay. 1987.Google Scholar
V. Radhakrishnan and G. NagarajaInference of Regular Grammars via Skeletons. IEEE Trans. on Systems, Man and Cybernetics, 17, No. 6 (1987) 982–992.MathSciNetGoogle Scholar
V. Radhakrishnan and G. NagarajaInference of Even Linear Languages and Its Application to Picture Description Languages. Pattern Recognition,21, No. 1 (1988) 55–62.zbMATHMathSciNetCrossRefGoogle Scholar
G. RozenbergDirect Proofs of the Undecidability of the Equivalence Problem for Sentential Forms of Linear Context-Free Grammars and the Equivalence Problem for 0L Systems. Information Processing Letters 1 (1972) 233–235.zbMATHCrossRefGoogle Scholar
J. Ruiz and P. GarcíaThe algorithms RT and k-TTI: A first comparison. Proceedings of the Second International Colloquium, ICGI-94. LNAI Vol. 862, pp 180–188. 1994.Google Scholar
J.M. Sempere and P. GarcíaA Characterization of Even Linear Languages and its Application to the Learning Problem. Proceedings of the Second International Colloquium, ICGI-94. LNAI Vol. 862, pp 38–44. Springer-Verlag. 1994.Google Scholar
José M. Sempere and Antonio FosLearning linear grammars from Structural Information. Proceedings of the Third International Colloquium, ICGI-96. LNAI Vol. 1147, pp 126–133. Springer-Verlag. 1996.Google Scholar
Y. TakadaInferring Parenthesis Linear Grammars Based on Control Sets. Journal of Information Processing, 12, No. 1 (1988) 27–33.zbMATHMathSciNetGoogle Scholar