Conferences in DBLP
Francisco Casacuberta Inference of Finite-State Transducers by Using Regular Grammars and Morphisms. [Citation Graph (0, 0)][DBLP ] Conf ] Francisco Casacuberta , Colin de la Higuera Computational Complexity of Problems on Probabilistic Grammars and Transducers. [Citation Graph (0, 0)][DBLP ] Conf ] François Coste , Daniel Fredouille Efficient Ambiguity Detection in C-NFA, a Step Towards the Inference on Non Deterministic Automata. [Citation Graph (0, 0)][DBLP ] Conf ] François Denis , Aurélien Lemay , Alain Terlutte Learning Regular Languages Using Non Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Dupont , Juan-Carlos Amengual Smoothing Probabilistic Automata: An Error-Correcting Approach. [Citation Graph (0, 0)][DBLP ] Conf ] J. D. Emerald , K. G. Subramanian , D. G. Thomas Inferring Subclasses of Contextual Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Henning Fernau , José M. Sempere Permutations and Control Sets for Learning Non-regular Language Families. [Citation Graph (0, 0)][DBLP ] Conf ] Christophe Costa Florêcio On the Complexity of Consistent Identification of Some Classes of Structure Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Ana L. N. Fred Computation of Substring Probabilities in Stochastic Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Pedro García , Antonio Cano , José Ruiz A Comparative Study of Two Algorithms for Automata Identification. [Citation Graph (0, 0)][DBLP ] Conf ] Gabriela Guimarães The Induction of Temporal Grammatical Rules from Multivariate Time Series. [Citation Graph (0, 0)][DBLP ] Conf ] Colin de la Higuera , Franck Thollard Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Satoshi Kobayashi Iterated Transductions and Efficient Learning from Positive Data: A Unifying View. [Citation Graph (0, 0)][DBLP ] Conf ] Pavel Martinek An Inverse Limit of Context-Free Grammars - A New Approach to Identifiability in the Limit. [Citation Graph (0, 0)][DBLP ] Conf ] Katsuhiko Nakamura , Takashi Ishiwata Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Francisco Nevado , Joan-Andreu Sánchez , José-Miguel Benedí Combination of Estimation Algorithms and Grammatical Inference Techniques to Learn Stochastic Context-Free Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Rajesh Parekh , Vasant Honavar On the Relationship between Models for Learning in Helpful Environments. [Citation Graph (0, 0)][DBLP ] Conf ] Juan Ramón Rico-Juan , Jorge Calera-Rubio , Rafael C. Carrasco Probabilistic k -Testable Tree Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Yasubumi Sakakibara , Hidenori Muramatsu Learning Context-Free Grammars from Partially Structured Examples. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Sakamoto , Hiroki Arimura , Setsuo Arikawa Identification of Tree Translation Rules from Examples. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Stephan , Sebastiaan Terwijn Counting Extensional Differences in BC-Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Noriko Sugimoto , Takashi Toyoshima , Shinichi Shimozono , Kouichi Hirata Constructive Learning of Context-Free Languages with a Subpansive Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Yasuhiro Tajima , Etsuji Tomita A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample. [Citation Graph (0, 0)][DBLP ] Conf ] Juan Miguel Vilar Improve the Learning of Subsequential Transducers by Using Alignments and Dictionaries. [Citation Graph (0, 0)][DBLP ] Conf ] 