default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. ICGI 2010: Valencia, Spain
- José M. Sempere, Pedro García:
Grammatical Inference: Theoretical Results and Applications, 10th International Colloquium, ICGI 2010, Valencia, Spain, September 13-16, 2010. Proceedings. Lecture Notes in Computer Science 6339, Springer 2010, ISBN 978-3-642-15487-4
Invited Talks
- Simon M. Lucas
:
Grammatical Inference and Games: Extended Abstract. 1-4 - David B. Searls:
Molecules, Languages and Automata. 5-10
Regular Papers
- Antonio Cano Gómez:
Inferring Regular Trace Languages from Positive and Negative Samples. 11-23 - Alexander Clark:
Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher. 24-37 - Alexander Clark:
Learning Context Free Grammars with the Syntactic Concept Lattice. 38-51 - Pedro García, Manuel Vazquez de Parga, Damián López, José Ruiz:
Learning Automata Teams. 52-65 - Marijn Heule, Sicco Verwer:
Exact DFA Identification Using SAT Solvers. 66-79 - Joshua Jones, Tim Oates:
Learning Deterministic Finite Automata from Interleaved Strings. 80-93 - Efim B. Kinber:
Learning Regular Expressions from Representative Examples and Membership Queries. 94-108 - Hongyang Li, Frank Stephan:
Splitting of Learnable Classes. 109-121 - Franco M. Luque, Gabriel G. Infante López:
PAC-Learning Unambiguous k, l-NTS <= Languages. 122-134 - Franco M. Luque, Gabriel G. Infante López:
Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammars. 135-147 - Karl Meinke:
CGE: A Sequential Learning Algorithm for Mealy Automata. 148-162 - Wico Mulder, Pieter W. Adriaans:
Using Grammar Induction to Model Adaptive Behavior of Networks of Collaborative Agents. 163-177 - Piedachu Peris, Damián López:
Transducer Inference by Assembling Specific Languages. 178-188 - Frédéric Tantini, Alain Terlutte, Fabien Torre:
Sequences Classification by Least General Generalisations. 189-202 - Sicco Verwer, Mathijs de Weerdt, Cees Witteveen:
A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data. 203-216 - Wojciech Wieczorek:
A Local Search Algorithm for Grammatical Inference. 217-229 - Ryo Yoshinaka:
Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries. 230-244 - Menno van Zaanen, Tanja Gaustad:
Grammatical Inference as Class Discrimination. 245-257
Short Papers
- Pieter W. Adriaans, Wico Mulder:
MDL in the Limit. 258-261 - Hasan Ibne Akram, Colin de la Higuera, Huang Xiao, Claudia Eckert:
Grammatical Inference Algorithms in MATLAB. 262-266 - Gloria Inés Alvarez, Jorge Hernán Victoria, Enrique Bravo, Pedro García:
A Non-deterministic Grammar Inference Algorithm Applied to the Cleavage Site Prediction Problem in Bioinformatics. 267-270 - Borja Balle, Jorge Castro, Ricard Gavaldà:
Learning PDFA with Asynchronous Transitions. 271-275 - Barrett R. Bryant, Marjan Mernik, Dejan Hrncic, Faizan Javed, Qichao Liu, Alan P. Sprague:
Grammar Inference Technology Applications in Software Engineering. 276-279 - Christophe Costa Florêncio, Henning Fernau:
Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG. 280-283 - M. Jayasrirani, D. Gnanaraj Thomas, Atulya K. Nagar, T. Robinson:
Learning of Church-Rosser Tree Rewriting Systems. 284-287 - Anna Kasprzik:
Generalizing over Several Learning Settings. 288-292 - Sophia Katrenko, Menno van Zaanen:
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us. 293-296 - Katia Kermanidis:
Extracting Shallow Paraphrasing Schemata from Modern Greek Text Using Statistical Significance Testing and Supervised Learning. 297-300 - Sindhu J. Kumaar, P. J. Abisha, D. Gnanaraj Thomas:
Learning Subclasses of Parallel Communicating Grammar Systems. 301-304 - Herman Stehouwer, Menno van Zaanen:
Enhanced Suffix Arrays as Language Models: Virtual k-Testable Languages. 305-308 - Olgierd Unold:
Learning Fuzzy Context-Free Grammar - A Preliminary Report. 309-312 - Mitsuo Wakatsuki, Etsuji Tomita:
Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers. 313-316
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 2024-12-10 20:50 CET 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:
