Conferences in DBLP

International Colloquium on Grammatical Inference (ICGI) (icgi)
2008 (conf/icgi/2008)

1. 
   Learning Meaning Before Syntax. [Citation Graph (, )][DBLP]
   
   
2. 
   Schema-Guided Induction of Monadic Queries. [Citation Graph (, )][DBLP]
   
   
3. 
   A Polynomial Algorithm for the Inference of Context Free Languages. [Citation Graph (, )][DBLP]
   
   
4. 
   Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings. [Citation Graph (, )][DBLP]
   
   
5. 
   Relevant Representations for the Inference of Rational Stochastic Tree Languages. [Citation Graph (, )][DBLP]
   
   
6. 
   Learning Commutative Regular Languages. [Citation Graph (, )][DBLP]
   
   
7. 
   Learning Left-to-Right and Right-to-Left Iterative Languages. [Citation Graph (, )][DBLP]
   
   
8. 
   Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets. [Citation Graph (, )][DBLP]
   
   
9. 
   A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness. [Citation Graph (, )][DBLP]
   
   
10. 
    On Learning Regular Expressions and Patterns Via Membership and Correction Queries. [Citation Graph (, )][DBLP]
    
    
11. 
    State-Merging DFA Induction Algorithms with Mandatory Merge Constraints. [Citation Graph (, )][DBLP]
    
    
12. 
    Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries. [Citation Graph (, )][DBLP]
    
    
13. 
    Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata. [Citation Graph (, )][DBLP]
    
    
14. 
    Learning Context-Sensitive Languages from Linear Structural Information. [Citation Graph (, )][DBLP]
    
    
15. 
    Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries. [Citation Graph (, )][DBLP]
    
    
16. 
    How to Split Recursive Automata. [Citation Graph (, )][DBLP]
    
    
17. 
    A Note on the Relationship between Different Types of Correction Queries. [Citation Graph (, )][DBLP]
    
    
18. 
    Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering. [Citation Graph (, )][DBLP]
    
    
19. 
    Polynomial Distinguishability of Timed Automata. [Citation Graph (, )][DBLP]
    
    
20. 
    Evaluation and Comparison of Inferred Regular Grammars. [Citation Graph (, )][DBLP]
    
    
21. 
    Identification in the Limit of k, l-Substitutable Context-Free Languages. [Citation Graph (, )][DBLP]
    
    
22. 
    Learning Subclasses of Pure Pattern Languages. [Citation Graph (, )][DBLP]
    
    
23. 
    Which Came First, the Grammar or the Lexicon?. [Citation Graph (, )][DBLP]
    
    
24. 
    Learning Node Label Controlled Graph Grammars (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
25. 
    Inference of Uniquely Terminating EML. [Citation Graph (, )][DBLP]
    
    
26. 
    Estimating Graph Parameters Using Graph Grammars. [Citation Graph (, )][DBLP]
    
    
27. 
    Learning of Regular omega-Tree Languages. [Citation Graph (, )][DBLP]
    
    
28. 
    Inducing Regular Languages Using Grammar-Based Classifier System. [Citation Graph (, )][DBLP]
    
    
29. 
    Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems. [Citation Graph (, )][DBLP]