Volume 21: International Conference on Grammatical Inference, 5-8 September 2012, University of Maryland, College Park, MD, USA


Editors: Jeffrey Heinz, Colin Higuera, Tim Oates





Jeffrey Heinz,  Colin de la Higuera,  Tim Oates ; PMLR 21:1-3

Accepted Papers

Learning and Testing the Bounded Retransmission Protocol

Fides Aarts,  Harco Kuppens,  Jan Tretmans,  Frits Vaandrager,  Sicco Verwer ; PMLR 21:4-18

Actively Learning Probabilistic Subsequential Transducers

Hasan Ibne Akram,  Colin La Higuera,  Claudia Eckert ; PMLR 21:19-33

Bootstrapping and Learning PDFA in Data Streams

Borja Balle,  Jorge Castro,  Ricard Gavaldà ; PMLR 21:34-48

Speeding Up Syntactic Learning Using Contextual Information

Leonor Becerra Bonache,  Elisa Fromont,  Amaury Habrard,  Michaël Perrot,  Marc Sebban ; PMLR 21:49-53

Clearing Restarting Automata and Grammatical Inference

Peter Černo ; PMLR 21:54-68

Integrating Grammatical Inference into Robotic Planning

Jane Chandlee,  Jie Fu,  Konstantinos Karydis,  Cesar Koirala,  Jeffrey Heinz,  Herbert Tanner ; PMLR 21:69-83

Beyond Semilinearity: Distributional Learning of Parallel Multiple Context-free Grammars

Alexander Clark,  Ryo Yoshinaka ; PMLR 21:84-96

Locally Substitutable Languages for Enhanced Inductive Leaps

François Coste,  Gaëlle Garet,  Jacques Nicolas ; PMLR 21:97-111

Grammar Induction: Beyond Local Search

Jason Eisner ; PMLR 21:112-113

Learning Substitutable Binary Plane Graph Grammars

Rémi Eyraud,  Jean-Christophe Janodet,  Tim Oates ; PMLR 21:114-128

Learning Tree Adjoining Grammars from Structures and Strings

Christophe Costa Florêncio ; PMLR 21:129-132

Improving Model Inference of Black Box Components having Large Input Test Set

Muhammad Naeem Irfan,  Roland Groz,  Catherine Oriat ; PMLR 21:133-138

Learning of Bi-$\omega$ Languages from Factors

M. Jayasrirani,  M. H. Begam,  D. G. Thomas,  J. D. Emerald ; PMLR 21:139-144

Inducing Partially Observable Markov Decision Processes

Michael L. Littman ; PMLR 21:145-148

Inference of k-Testable Directed Acyclic Graph Languages

Damiàn Lòpez,  Jorge Calera-Rubio,  Javier Gallego-Sànchez ; PMLR 21:149-163

A Lattice of Sets of Alignments Built on the Common Subwords in a Finite Language

Laurent Miclet,  Nelly Barbot,  Baptiste Jeudy ; PMLR 21:164-176

Estimation of Generating Processes of Strings Represented with Patterns and Refinements

Keisuke Otaki,  Akihiro Yamamoto ; PMLR 21:177-182

Applying Grammar Inference To Identify Generalized Patterns of Facial Expressions of Pain

Ute Schmid,  Michael Siebers,  Dominik Seuß,  Miriam Kunz,  Stefan Lautenbacher ; PMLR 21:183-188

Bootstrapping Dependency Grammar Inducers from Incomplete Sentence Fragments via Austere Models

Valentin I. Spitkovsky,  Hiyan Alshawi,  Daniel Jurafsky ; PMLR 21:189-194

Active Automata Learning: From DFAs to Interface Programs and Beyond

Bernhard Steffen,  Falk Howar,  Malte Isberner ; PMLR 21:195-209

Fuzzy Grammar-based Prediction of Amyloidogenic Regions

Olgierd Unold ; PMLR 21:210-219

Learning Interpretations Using Sequence Classification

Menno Zaanen,  Janneke Loo ; PMLR 21:220-223

Model Merging Versus Model Splitting Context-Free Grammar Induction

Menno Zaanen,  Nanne Noord ; PMLR 21:224-236

Induction of Non-Deterministic Finite Automata on Supercomputers

Wojciech Wieczorek ; PMLR 21:237-242

Results of the PAutomaC Probabilistic Automaton Learning Competition

Sicco Verwer,  Rémi Eyraud,  Colin Higuera ; PMLR 21:243-248

Treba: Efficient Numerically Stable EM for PFA

Mans Hulden ; PMLR 21:249-253

Simple Variable Length N-grams for Probabilistic Automata Learning

Fabio N. Kepler,  Sergio L. S. Mergen,  Cleo Z. Billa ; PMLR 21:254-258

Marginalizing Out Transition Probabilities for Several Subclasses of PFAs

Chihiro Shibata,  Ryo Yoshinaka ; PMLR 21:259-263

subscribe via RSS