Grammatical inference: algorithms and applications : 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 : proceedings

• Main Authors: International Colloquium on Grammatical Inference, Clark, Alexander, Coste, Francois, Miclet, L. (Laurent)
• Format: eBook Book Conference Proceeding
• Language: English
• Published: Berlin Springer 2008; Springer Berlin / Heidelberg; Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Artificial Intelligence; Computer Science; Congresses; Formal languages; Formal languages > Congresses; Logic, Symbolic and mathematical; Logic, Symbolic and mathematical > Congresses; Logics and Meanings of Programs; Machine Learning; Mathematical Logic and Formal Languages; Programming Languages, Compilers, Interpreters; Programming Techniques
• ISBN: 3540880089; 9783540880080
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-88009-7

This book constitutes the refereed proceedings of the 9th International Colloquium on Grammatical Inference, ICGI 2008, held in Saint-Malo, France, in September 2008. The 21 revised full papers and 8 revised short papers presented were carefully reviewed and selected from 36 submissions. The topics...

Table of Contents:

• Inducing Regular Languages Using Grammar-Based Classifier System -- Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems -- Author Index
• Intro -- Preface -- Organization -- Table of Contents -- Learning Meaning Before Syntax -- Schema-Guided Induction of Monadic Queries -- A Polynomial Algorithm for the Inference of Context Free Languages -- Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings -- Relevant Representations for the Inference of Rational Stochastic Tree Languages -- Learning Commutative Regular Languages -- Learning Left-to-Right and Right-to-Left Iterative Languages -- Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets -- A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness -- On Learning Regular Expressions and Patterns Via Membership and Correction Queries -- State-Merging DFA Induction Algorithms with Mandatory Merge Constraints -- Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries -- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata -- Learning Context-Sensitive Languages from Linear Structural Information -- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries -- How to Split Recursive Automata -- A Note on the Relationship between Different Types of Correction Queries -- Unsupervised Learning of Probabilistic Context-Free Grammar Using Iterative Biclustering -- Polynomial Distinguishability of Timed Automata -- Evaluation and Comparison of Inferred Regular Grammars -- Identification in the Limit of k,l-Substitutable Context-Free Languages -- Learning Subclasses of Pure Pattern Languages -- Which Came First, the Grammar or the Lexicon? -- Learning Node Label Controlled Graph Grammars (Extended Abstract) -- Inference of Uniquely Terminating EML -- Estimating Graph Parameters Using Graph Grammars -- Learning of Regular omega-Tree Languages