Abstract is missing.
- Inference of Finite-State Transducers by Using Regular Grammars and MorphismsFrancisco Casacuberta. 1-14
- Computational Complexity of Problems on Probabilistic Grammars and TransducersFrancisco Casacuberta, Colin de la Higuera. 15-24
- Efficient Ambiguity Detection in C-NFA, a Step Towards the Inference on Non Deterministic AutomataFrançois Coste, Daniel Fredouille. 25-38
- Learning Regular Languages Using Non Deterministic Finite AutomataFrançois Denis, Aurélien Lemay, Alain Terlutte. 39-50
- Smoothing Probabilistic Automata: An Error-Correcting ApproachPierre Dupont, Juan-Carlos Amengual. 51-64
- Inferring Subclasses of Contextual LanguagesJ. D. Emerald, K. G. Subramanian, D. G. Thomas. 65-74
- Permutations and Control Sets for Learning Non-regular Language FamiliesHenning Fernau, José M. Sempere. 75-88
- On the Complexity of Consistent Identification of Some Classes of Structure LanguagesChristophe Costa Florêncio. 89-102
- Computation of Substring Probabilities in Stochastic GrammarsAna L. N. Fred. 103-114
- A Comparative Study of Two Algorithms for Automata IdentificationPedro Garcia, Antonio Cano, José Ruiz. 115-126
- The Induction of Temporal Grammatical Rules from Multivariate Time SeriesGabriela Guimarães. 127-140
- Identification in the Limit with Probability One of Stochastic Deterministic Finite AutomataColin de la Higuera, Franck Thollard. 141-156
- Iterated Transductions and Efficient Learning from Positive Data: A Unifying ViewSatoshi Kobayashi. 157-170
- An Inverse Limit of Context-Free Grammars - A New Approach to Identifiability in the LimitPavel Martinek. 171-185
- Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK AlgorithmKatsuhiko Nakamura, Takashi Ishiwata. 186-195
- Combination of Estimation Algorithms and Grammatical Inference Techniques to Learn Stochastic Context-Free GrammarsFrancisco Nevado, Joan-Andreu Sánchez, José-Miguel Benedí. 196-206
- On the Relationship between Models for Learning in Helpful EnvironmentsRajesh Parekh, Vasant Honavar. 207-220
- Probabilistic ::::k::::-Testable Tree LanguagesJuan Ramón Rico-Juan, Jorge Calera-Rubio, Rafael C. Carrasco. 221-228
- Learning Context-Free Grammars from Partially Structured ExamplesYasubumi Sakakibara, Hidenori Muramatsu. 229-240
- Identification of Tree Translation Rules from ExamplesHiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa. 241-255
- Counting Extensional Differences in BC-LearningFrank Stephan, Sebastiaan Terwijn. 256-269
- Constructive Learning of Context-Free Languages with a Subpansive TreeNoriko Sugimoto, Takashi Toyoshima, Shinichi Shimozono, Kouichi Hirata. 270-283
- A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative SampleYasuhiro Tajima, Etsuji Tomita. 284-297
- Improve the Learning of Subsequential Transducers by Using Alignments and DictionariesJuan Miguel Vilar. 298-311