ICGI 2010 Accepted works

Full papers
  1. Learning Regular Expressions from Representative Examples and Membership Queries.
    Efim Kinber

  2. Learning Automata Teams.
    Pedro García, Manuel Vázquez de Parga, Damián López, José Ruiz

  3. A Local Search Algorithm for Grammatical Inference.
    Wojciech Wieczorek

  4. Learning Context Free Grammars with the Syntactic Concept Lattice.
    Alexander Clark

  5. Distributional Learning of some Context-free Languages with a Minimally Adequate Teacher.
    Alexander Clark

  6. CGE: A Sequential Learning Algorithm for Mealy Automata.
    Karl Meinke

  7. Using grammar induction to model adaptive behaviour of networks of collaborative agents.
    Wico Mulder, Pieter Adriaans

  8. Splitting of Learnable Classes.
    Hongyang Li, Frank Stephan

  9. Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries.
    Ryo Yoshinaka

  10. Sequences Classification by Least General Generalisations
    Frédéric Tantini, Alain Terlutte, Fabien Torre

  11. Transducer inference by assembling specific languages.
    Piedachu Peris, Damián López

  12. Exact DFA Identification Using SAT Solvers.
    Marijn Heule, Sicco Verwer

  13. A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data.
    Sicco Verwer, Mathijs de Weerdt, Cees Witteveen

  14. Learning Deterministic Finite Automata from Interleaved Strings.
    Joshua Jones, Tim Oates

  15. PAC-Learning Unambiguous k,l-NTS\leq Languages.
    Franco M. Luque, Gabriel Infante-López

  16. Inferring Regular Trace Languages from positive and negative samples.
    Antonio Cano Gomez

  17. Grammatical Inference as Class Discrimination.
    Menno van Zaanen, Tanja Gaustad

  18. Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammars
    Franco M. Luque, Gabriel Infante-López
Short papers (posters)
  1. Extracting Shallow Paraphrasing Schemata from Modern Greek Text Using Statistical Significance Testing and Supervised Learning.
    Katia Lida Kermanidis

  2. Learning Subclasses of Parallel Communicating Grammar Systems.
    Sindhu J Kumaar, P.J. Abisha, D.G. Thomas

  3. Generalizing over several learning settings.
    Anna Kasprzik

  4. Enhanced Suffix Arrays as Language Models: Virtual k-testable Languages.
    Herman Stehouwer, Menno Van Zaanen

  5. A Non Deterministic Grammar Inference Algorithm Applied to the Cleavage Site Prediction Problem in Bioinformatics.
    Gloria Inés Álvarez, Jorge Hernán Victoria, Enrique Bravo, Pedro García

  6. Polynomial time identification of strict prefix deterministic finite state transducers.
    Mitsuo Wakatsuki, Etsuji Tomita

  7. Learning PDFA with Asynchronous Transitions.
    Borja Balle, Jorge Castro, Ricard Gavaldà

  8. Learning of Church-Rosser Tree Rewriting Systems.
    M. Jeyasrirani, D.G. Thomas, Atulya K.Nagar, T. Robinson

  9. Holder norms and a hierarchy theorem for parameterized classes of CCG.
    Christophe Costa Florencio, Henning Fernau

  10. Rademacher Complexity and Grammar Induction Algorithms.
    Sophia Katrenko, Menno van Zaanen

  11. Learning fuzzy context-free grammar--a preliminary report.
    Olgierd Unold

  12. MDL in the limit.
    Pieter Adriaans, Wico Mulder.

  13. Grammatical Inference Algorithms in MATLAB.
    Hasan Ibne Akram, Colin de la Higuera, Huang Xiao, Claudia Eckert

  14. Grammar Inference Technology Applications in Software Engineering.
    Barrett Bryant, Marjan Mernik, Dejan Hrncic, Faizan Javed, Qichao Liu