default search action
9. ICGI 2008: Saint-Malo, France
- Alexander Clark, François Coste
, Laurent Miclet:
Grammatical Inference: Algorithms and Applications, 9th International Colloquium, ICGI 2008, Saint-Malo, France, September 22-24, 2008, Proceedings. Lecture Notes in Computer Science 5278, Springer 2008, ISBN 978-3-540-88008-0
Regular Papers
- Dana Angluin, Leonor Becerra-Bonache:
Learning Meaning Before Syntax. 1-14 - 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
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 - Antonio Cano Gómez, Gloria Inés Alvarez:
Learning Commutative Regular Languages. 71-83 - 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 G. Honavar
Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering. 224-237 - Sicco Verwer, Mathijs de Weerdt
Polynomial Distinguishability of Timed Automata. 238-251 - Neil Walkinshaw
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. Gnanaraj Thomas, Sindhu J. Kumaar:
Learning Subclasses of Pure Pattern Languages. 280-282 - Tom Armstrong, Tim Oates:
Which Came First, the Grammar or the Lexicon?. 283-285 - Christophe Costa Florêncio:
Learning Node Label Controlled Graph Grammars (Extended Abstract). 286-288 - S. Kannamma, D. Gnanaraj Thomas, K. Rangarajan:
Inference of Uniquely Terminating EML. 289-291 - Sourav Mukherjee, Tim Oates:
Estimating Graph Parameters Using Graph Grammars. 292-294 - 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
Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems. 301-303
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-07-19 02:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: