Learning a subclass of linear languages from positive structural information

  • José M. Sempere
  • G. Nagaraja
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1433)


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 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AP64]
    V. Amar, G. PutzoluOn a Family of Linear Grammars. Information and Control 7 (1964) 283–291.MATHMathSciNetCrossRefGoogle Scholar
  2. [Ga93]
    P. García Learning k-Testable Tree Sets from positive data. Departamento de Sistemas Informáticos y Computación. Universidad Politécnica de Valencia. Technical report DSIC-II/46/93. 1993.Google Scholar
  3. [Go64]
    E. Mark GoldLanguage Identification in the Limit. Information and Control,10 (1969) 447–474.CrossRefGoogle Scholar
  4. [Ha78]
    M. Harrison Introduction to Formal Language Theory. Addison-Wesley Publishing Company. 1978.Google Scholar
  5. [Hi97]
    C. de la HigueraCharacteristic Sets for Polynomial Grammatical Inference. Machine Learning 27 (1997) 125–138.MATHCrossRefGoogle Scholar
  6. [KMT97]
    T. Koshiba, E. MÄkinen, Y. TakadaLearning deterministic even linear languages from positive examples. Theoretical Computer Science 185 (1997) 63–97.MATHMathSciNetCrossRefGoogle Scholar
  7. [Ma90]
    E. MÄkinenThe grammatical inference problem for the Szilard languages of Linear Grammars. Information Processing Letters 36 (1990) 203–206.MATHMathSciNetCrossRefGoogle Scholar
  8. [Ma92a]
    E. MÄkinenOn the structural grammatical inference problem for some classes of context-free grammars. Information Processing Letters 42 (1992) 1–5.MATHMathSciNetCrossRefGoogle Scholar
  9. [Ma92b]
    E. MÄkinenRemarks on the structural grammatical inference problem for context-free grammars. Information Processing Letters 44 (1992) 125–127.MATHMathSciNetCrossRefGoogle Scholar
  10. [Ma96]
    E. MÄkinenA note on the grammatical inference problem for even linear languages. Fundamenta Informaticae 25, No. 2 (1996) 175–181.MATHMathSciNetGoogle Scholar
  11. [Ra87]
    V. RadhakrishnanGrammatical Inference from Positive Data: An Effective Integrated Approach. Ph.D. Thesis. Department of Computer Science and Engineering. HT Bombay. 1987.Google Scholar
  12. [RN87]
    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
  13. [RN88]
    V. Radhakrishnan and G. NagarajaInference of Even Linear Languages and Its Application to Picture Description Languages. Pattern Recognition,21, No. 1 (1988) 55–62.MATHMathSciNetCrossRefGoogle Scholar
  14. [Ro72]
    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.MATHCrossRefGoogle Scholar
  15. [RG94]
    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
  16. [Sa90]
    Y. SakakibaraLearning context-free grammars from structural data in polynomial time. Theoretical Computer Science 76 (1990) 223–242.MATHMathSciNetCrossRefGoogle Scholar
  17. [Sa92]
    Y. SakakibaraEfficient Learning of Context-Free Grammars from Positive Structural Examples. Information and Computation 97 (1992) 23–60.MATHMathSciNetCrossRefGoogle Scholar
  18. [SG94]
    J.M. Sempere and P. García A 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
  19. [SF96]
    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
  20. [Ta88a]
    Y. TakadaInferring Parenthesis Linear Grammars Based on Control Sets. Journal of Information Processing, 12, No. 1 (1988) 27–33.MATHMathSciNetGoogle Scholar
  21. [Ta88b]
    Y. TakadaGrammatical Inference for Even Linear Languages based on Control Sets. Information Processing Letters. 28, No. 4 (1988) 193–199.MATHMathSciNetCrossRefGoogle Scholar
  22. [Ta95]
    Y. TakadaA hierarchy of languages families learnable by regular language learning. Information and Computation, 123(1) (1995) 138–145.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • José M. Sempere
    • 1
  • G. Nagaraja
    • 2
  1. 1.DSICUniversidad Politécnica de ValenciaValenciaSpain
  2. 2.DCSEIndian Institute of TechnologyPowai, MumbaiIndia

Personalised recommendations