4. ICGI 1998: Ames, Iowa, USA

@proceedings{DBLP:conf/icgi/1998,
  editor    = {Vasant Honavar and
               Giora Slutzki},
  title     = {Grammatical Inference, 4th International Colloquium, ICGI-98,
               Ames, Iowa, USA, July 12-14, 1998, Proceedings},
  booktitle = {ICGI},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1433},
  year      = {1998},
  isbn      = {3-540-64776-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Kevin J. Lang, Barak A. Pearlmutter, Rodney A. Price:
  Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm. 1-12
  Electronic Edition (Springer LINK) BibTeX
• Peter Rossmanith, Thomas Zeugmann:
  Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data. 13-24
  Electronic Edition (Springer LINK) BibTeX
• Isabelle Tellier:
  Meaning Helps Learning Syntax. 25-36
  Electronic Edition (Springer LINK) BibTeX
• Rajesh Parekh, Codrin M. Nichitiu, Vasant Honavar:
  A Polynominal Time Incremental Algorithm for Learning DFA. 37-49
  Electronic Edition (Springer LINK) BibTeX
• José Oncina:
  The Data Driven Approach Applied to the OSTIA Algorithm. 50-56
  Electronic Edition (Springer LINK) BibTeX
• Vlado Keselj:
  Grammar Model and Grammar Induction in the System NL PAGE. 57-66
  Electronic Edition (Springer LINK) BibTeX
• Antonio Castellanos:
  Approximate Learning of Random Subsequential Transducers. 67-78
  Electronic Edition (Springer LINK) BibTeX
• Colin de la Higuera:
  Learning Stochastic Finite Automata from Experts. 79-89
  Electronic Edition (Springer LINK) BibTeX
• Laura Firoiu, Tim Oates, Paul R. Cohen:
  Learning Deterministic Finite Automaton with a Recurrent Neural Network. 90-101
  Electronic Edition (Springer LINK) BibTeX
• Jacques Chodorowski, Laurent Miclet:
  Applying Grammatical Inference in Learning a Language Model for Oral Dialogue. 102-113
  Electronic Edition (Springer LINK) BibTeX
• Jerome A. Feldman:
  Real Language Learning. 114-125
  Electronic Edition (Springer LINK) BibTeX
• Hugues Juillé, Jordan B. Pollack:
  A Stochastic Search Approach to Grammar Induction. 126-137
  Electronic Edition (Springer LINK) BibTeX
• David Picó, Enrique Vidal:
  Transducer-Learning Experiments on Language Understanding. 138-149
  Electronic Edition (Springer LINK) BibTeX
• José Ruiz, Salvador España, Pedro García:
  Locally Threshold Testable Languages in Strict Sense: Application to the Inference Problem. 150-161
  Electronic Edition (Springer LINK) BibTeX
• José M. Sempere, G. Nagaraja:
  Learning a Subclass of Linear Languages from Positive Structural Information. 162-174
  Electronic Edition (Springer LINK) BibTeX
• Alexander S. Saidi, Souad Tayeb-bey:
  Grammatical Inference in Document Recognition. 175-186
  Electronic Edition (Springer LINK) BibTeX
• Rafael C. Carrasco, José Oncina, Jorge Calera-Rubio:
  Stochastic Inference of Regular Tree Languages. 187-198
  Electronic Edition (Springer LINK) BibTeX
• François Coste, Jacques Nicolas:
  How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree. 199-210
  Electronic Edition (Springer LINK) BibTeX
• Pedro P. Cruz-Alcázar, Enrique Vidal:
  Learning Regular Grammars to Model Musical Style: Comparing Different Coding Schemes. 211-222
  Electronic Edition (Springer LINK) BibTeX
• J. D. Emerald, K. G. Subramanian, D. G. Thomas:
  Learning a Subclass of Context-Free Languages. 223-231
  Electronic Edition (Springer LINK) BibTeX
• Pierre Dupont, Lin Chase:
  Using Symbol Clustering to Improve Probabilistic Automaton Inference. 232-243
  Electronic Edition (Springer LINK) BibTeX
• Peter Viechnicki:
  A Performance Evaluation of Automatic Survey Classifiers. 244-256
  Electronic Edition (Springer LINK) BibTeX
• Alvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen:
  Pattern Discovery in Biosequences. 257-270
  Electronic Edition (Springer LINK) BibTeX