9. ICGI 2008: Saint-Malo, France
Alexander Clark, François Coste, Laurent Miclet (Eds.): Grammatical Inference: Algorithms and Applications, 9th International Colloquium, ICGI 2008, Saint-Malo, France, September 22-24, 2008, Proceedings. Springer 2008 Lecture Notes in Computer Science ISBN 978-3-540-88008-0
Regular Papers
- Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren: Schema-Guided Induction of Monadic Queries. 15-28
- Alexander Clark, Rémi Eyraud, Amaury Habrard: A Polynomial Algorithm for the Inference of Context Free Languages. 29-42
- Colin de la Higuera, Jean-Christophe Janodet, Frédéric Tantini: Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings. 43-56
- François Denis, Édouard Gilbert, Amaury Habrard, Faissal Ouardi, Marc Tommasi: Relevant Representations for the Inference of Rational Stochastic Tree Languages. 57-70
- Jeffrey Heinz: Learning Left-to-Right and Right-to-Left Iterative Languages. 84-97
- Yuichi Kameda, Hiroo Tokunaga, Akihiro Yamamoto: Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets. 98-110
- Anna Kasprzik: A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness. 111-124
- Efim B. Kinber: On Learning Regular Expressions and Patterns Via Membership and Correction Queries. 125-138
- Bernard Lambeau, Christophe Damas, Pierre Dupont: State-Merging DFA Induction Algorithms with Mandatory Merge Constraints. 139-153
- José Oncina: Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries. 154-162
- Jorge Castro, Ricard Gavaldà: Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata. 163-174
- José M. Sempere: Learning Context-Sensitive Languages from Linear Structural Information. 175-186
- Yasuhiro Tajima, Yoshiyuki Kotani: Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries. 187-199
- Isabelle Tellier: How to Split Recursive Automata. 200-212
- Cristina Tîrnauca: A Note on the Relationship between Different Types of Correction Queries. 213-223
- Kewei Tu, Vasant Honavar: Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering. 224-237
- Sicco Verwer, Mathijs de Weerdt, Cees Witteveen: Polynomial Distinguishability of Timed Automata. 238-251
- Neil Walkinshaw, Kirill Bogdanov, Ken Johnson: Evaluation and Comparison of Inferred Regular Grammars. 252-265
- Ryo Yoshinaka: Identification in the Limit of k, l-Substitutable Context-Free Languages. 266-279
Poster Papers
- P. J. Abisha, D. G. Thomas, Sindhu J. Kumaar: Learning Subclasses of Pure Pattern Languages. 280-282
- Christophe Costa Florêncio: Learning Node Label Controlled Graph Grammars (Extended Abstract). 286-288
- M. Jayasrirani, M. Humrosia Begam, D. Gnanaraj Thomas: Learning of Regular omega-Tree Languages. 295-297
- Olgierd Unold: Inducing Regular Languages Using Grammar-Based Classifier System. 298-300
- Menno van Zaanen, Jeroen Geertzen: Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems. 301-303
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team