Abstract is missing.
- Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging AlgorithmKevin J. Lang, Barak A. Pearlmutter, Rodney A. Price. 1-12 [doi]
- Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive DataPeter Rossmanith, Thomas Zeugmann. 13-24 [doi]
- Meaning Helps Learning SyntaxIsabelle Tellier. 25-36 [doi]
- A Polynominal Time Incremental Algorithm for Learning DFARajesh Parekh, Codrin M. Nichitiu, Vasant Honavar. 37-49 [doi]
- The Data Driven Approach Applied to the OSTIA AlgorithmJosé Oncina. 50-56 [doi]
- Grammar Model and Grammar Induction in the System NL PAGEVlado Keselj. 57-66 [doi]
- Approximate Learning of Random Subsequential TransducersAntonio Castellanos. 67-78 [doi]
- Learning Stochastic Finite Automata from ExpertsColin de la Higuera. 79-89 [doi]
- Learning Deterministic Finite Automaton with a Recurrent Neural NetworkLaura Firoiu, Tim Oates, Paul R. Cohen. 90-101 [doi]
- Applying Grammatical Inference in Learning a Language Model for Oral DialogueJacques Chodorowski, Laurent Miclet. 102-113 [doi]
- Real Language LearningJerome A. Feldman. 114-125 [doi]
- A Stochastic Search Approach to Grammar InductionHugues Juillé, Jordan B. Pollack. 126-137 [doi]
- Transducer-Learning Experiments on Language UnderstandingDavid Picó, Enrique Vidal. 138-149 [doi]
- Locally Threshold Testable Languages in Strict Sense: Application to the Inference ProblemJosé Ruiz, Salvador España Boquera, Pedro Garcia. 150-161 [doi]
- Learning a Subclass of Linear Languages from Positive Structural InformationJosé M. Sempere, G. Nagaraja. 162-174 [doi]
- Grammatical Inference in Document RecognitionAlexander S. Saidi, Souad Tayeb-bey. 175-186 [doi]
- Stochastic Inference of Regular Tree LanguagesRafael C. Carrasco, José Oncina, Jorge Calera-Rubio. 187-198 [doi]
- How Considering Incompatible State Mergings May Reduce the DFA Induction Search TreeFrançois Coste, Jacques Nicolas. 199-210 [doi]
- Learning Regular Grammars to Model Musical Style: Comparing Different Coding SchemesPedro P. Cruz-Alcázar, Enrique Vidal. 211-222 [doi]
- Learning a Subclass of Context-Free LanguagesJ. D. Emerald, K. G. Subramanian, D. G. Thomas. 223-231 [doi]
- Using Symbol Clustering to Improve Probabilistic Automaton InferencePierre Dupont, Lin Chase. 232-243 [doi]
- A Performance Evaluation of Automatic Survey ClassifiersPeter Viechnicki. 244-256 [doi]
- Pattern Discovery in BiosequencesAlvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen. 257-270 [doi]