default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. ICGI 2000: Lisbon, Portugal
- Arlindo L. Oliveira:
Grammatical Inference: Algorithms and Applications, 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000, Proceedings. Lecture Notes in Computer Science 1891, Springer 2000, ISBN 3-540-41011-2 - Francisco Casacuberta:
Inference of Finite-State Transducers by Using Regular Grammars and Morphisms. 1-14 - Francisco Casacuberta, Colin de la Higuera:
Computational Complexity of Problems on Probabilistic Grammars and Transducers. 15-24 - François Coste, Daniel Fredouille:
Efficient Ambiguity Detection in C-NFA, a Step Towards the Inference on Non Deterministic Automata. 25-38 - François Denis, Aurélien Lemay, Alain Terlutte:
Learning Regular Languages Using Non Deterministic Finite Automata. 39-50 - Pierre Dupont, Juan-Carlos Amengual:
Smoothing Probabilistic Automata: An Error-Correcting Approach. 51-64 - J. D. Emerald, K. G. Subramanian, D. Gnanaraj Thomas:
Inferring Subclasses of Contextual Languages. 65-74 - Henning Fernau
, José M. Sempere:
Permutations and Control Sets for Learning Non-regular Language Families. 75-88 - Christophe Costa Florêncio:
On the Complexity of Consistent Identification of Some Classes of Structure Languages. 89-102 - Ana L. N. Fred:
Computation of Substring Probabilities in Stochastic Grammars. 103-114 - Pedro García, Antonio Cano, José Ruiz:
A Comparative Study of Two Algorithms for Automata Identification. 115-126 - Gabriela Guimarães:
The Induction of Temporal Grammatical Rules from Multivariate Time Series. 127-140 - Colin de la Higuera, Franck Thollard:
Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata. 141-156 - Satoshi Kobayashi:
Iterated Transductions and Efficient Learning from Positive Data: A Unifying View. 157-170 - Pavel Martinek:
An Inverse Limit of Context-Free Grammars - A New Approach to Identifiability in the Limit. 171-185 - Katsuhiko Nakamura, Takashi Ishiwata:
Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm. 186-195 - Francisco Nevado, Joan-Andreu Sánchez, José-Miguel Benedí:
Combination of Estimation Algorithms and Grammatical Inference Techniques to Learn Stochastic Context-Free Grammars. 196-206 - Rajesh Parekh, Vasant G. Honavar:
On the Relationship between Models for Learning in Helpful Environments. 207-220 - Juan Ramón Rico-Juan, Jorge Calera-Rubio, Rafael C. Carrasco:
Probabilistic k-Testable Tree Languages. 221-228 - Yasubumi Sakakibara, Hidenori Muramatsu:
Learning Context-Free Grammars from Partially Structured Examples. 229-240 - Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa:
Identification of Tree Translation Rules from Examples. 241-255 - Frank Stephan, Sebastiaan Terwijn:
Counting Extensional Differences in BC-Learning. 256-269 - Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimozono, Kouichi Hirata:
Constructive Learning of Context-Free Languages with a Subpansive Tree. 270-283 - Yasuhiro Tajima, Etsuji Tomita:
A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample. 284-297 - Juan Miguel Vilar:
Improve the Learning of Subsequential Transducers by Using Alignments and Dictionaries. 298-311
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-10-31 20:19 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:
