The conference will be held in Iowa State University Memorial Union.

**July 12, 1998**

8:00am - 10:00am Registration

10:00am Welcome

10:15am *Results of the Abbadingo One DFA Learning Competition and a New
Evidence Driven State Merging Algorithm.*

K.J. Lang, B.A. Pearlmutter and R. Price

10:40am *Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data.*

P. Rossmanith and T. Zeugmann

11:05am - 11:10am Break

11:10am *Why Meaning Helps Learning Syntax.*

I. Tellier

11:35am *A Polynomial Time Incremental Algorithm for Learning DFA.*

R. Parekh, C. Nichitu and V. Honavar

12:00noon - 1:30pm Lunch

1:30pm - 3:30pm Tutorial: *Kolmogorov Complexity and its Applications*.

J. Lutz

3:30pm - 3:40pm Break

3:40pm *The Data Driven Approach Applied to the OSTIA Algorithm*.

J. Oncina

4:05pm *Grammar Model and Grammar Induction in the System NL Page*.

V. Keselj

8:45am - 9:00am Announcements

9.00am *Approximate Learning of Random Subsequential Transducers*.

A. Castellanos

9:25am *Learning Stochastic Finite Automata from Experts*.

C. de la Higuera.

9:50am *Learning a Determinisitic Finite Automaton with a Recurrent Neural Network*

L. Firoiu, T. Oates, and P. R. Cohen

10:15am *Applying Grammatical Inference by Learning a Language Model for
Oral Dialogue*.

J. Chodorowski and L. Miclet

10:40am - 10:45am Break

10:45am - 12:00noon **Invited Talk**: *Natural Language Learning*

J. Feldman.

12:00noon - 1:30pm Lunch

1:30pm *A Stochastic Search Approach to Grammar Induction*.

H. Juille and J. Pollack

1:55pm *Transducer-learning Experiments on Language Understanding*.

D. Picó and E. Vidal

2:20pm - 2:25pm Break

2:25pm *Locally Threshold Testable Languages in Strict Sense: Application to the Inference Problem*.

J. Ruiz, S. Espana, and P. Garcia

2:50pm *Learning a Subclass of Linear Languages from Positive Structural Information*.

J. Sempere and G. Nagaraja

3:15pm *Grammatical Inference in Document Recognition*

A. Saidi and S. Tayeb-bey

3:40pm - 3:45pm Break

3:45pm *Stochastic Regular Tree Language Inference*.

R. C. Carrasco, J. Oncina and J. Calera

4:10pm *How Considering Icompatible State Mergings May Reduce the DFA
Induction Search Tree*.

F. Coste and J. Nicolas

6:30pm - 9:00pm Banquet

9:00am *Learning Regular Grammars to Model Musical Style: Comparing
Different Coding Schemes*

P. Cruz-Alcazar and E. Vidal-Ruiz

9:25am *Learning a Subclass of Context-Free Languages*.

J. Emerald, K. Subramanian, and D. Thomas

9:50am *Using Symbol Clustering to Improve Probabilistic Automaton Inference*

P. Dupont and L. Chase

10:15am *A Performance Evaluation of automatic Survey Classifiers*.

P. Viechnicki

10:40am - 10:45am Break

10:45am - 12:00noon **Invited Talk**: *Pattern Discovery in Biosequences.*

A. Brazma.