The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Francisco Casacuberta
    Inference of Finite-State Transducers by Using Regular Grammars and Morphisms. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:1-14 [Conf]
  2. Francisco Casacuberta, Colin de la Higuera
    Computational Complexity of Problems on Probabilistic Grammars and Transducers. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:15-24 [Conf]
  3. 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]
    ICGI, 2000, pp:25-38 [Conf]
  4. François Denis, Aurélien Lemay, Alain Terlutte
    Learning Regular Languages Using Non Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:39-50 [Conf]
  5. Pierre Dupont, Juan-Carlos Amengual
    Smoothing Probabilistic Automata: An Error-Correcting Approach. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:51-64 [Conf]
  6. J. D. Emerald, K. G. Subramanian, D. G. Thomas
    Inferring Subclasses of Contextual Languages. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:65-74 [Conf]
  7. Henning Fernau, José M. Sempere
    Permutations and Control Sets for Learning Non-regular Language Families. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:75-88 [Conf]
  8. Christophe Costa Florêcio
    On the Complexity of Consistent Identification of Some Classes of Structure Languages. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:89-102 [Conf]
  9. Ana L. N. Fred
    Computation of Substring Probabilities in Stochastic Grammars. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:103-114 [Conf]
  10. Pedro García, Antonio Cano, José Ruiz
    A Comparative Study of Two Algorithms for Automata Identification. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:115-126 [Conf]
  11. Gabriela Guimarães
    The Induction of Temporal Grammatical Rules from Multivariate Time Series. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:127-140 [Conf]
  12. Colin de la Higuera, Franck Thollard
    Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:141-156 [Conf]
  13. Satoshi Kobayashi
    Iterated Transductions and Efficient Learning from Positive Data: A Unifying View. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:157-170 [Conf]
  14. Pavel Martinek
    An Inverse Limit of Context-Free Grammars - A New Approach to Identifiability in the Limit. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:171-185 [Conf]
  15. Katsuhiko Nakamura, Takashi Ishiwata
    Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:186-195 [Conf]
  16. 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]
    ICGI, 2000, pp:196-206 [Conf]
  17. Rajesh Parekh, Vasant Honavar
    On the Relationship between Models for Learning in Helpful Environments. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:207-220 [Conf]
  18. Juan Ramón Rico-Juan, Jorge Calera-Rubio, Rafael C. Carrasco
    Probabilistic k-Testable Tree Languages. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:221-228 [Conf]
  19. Yasubumi Sakakibara, Hidenori Muramatsu
    Learning Context-Free Grammars from Partially Structured Examples. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:229-240 [Conf]
  20. Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa
    Identification of Tree Translation Rules from Examples. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:241-255 [Conf]
  21. Frank Stephan, Sebastiaan Terwijn
    Counting Extensional Differences in BC-Learning. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:256-269 [Conf]
  22. Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimozono, Kouichi Hirata
    Constructive Learning of Context-Free Languages with a Subpansive Tree. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:270-283 [Conf]
  23. Yasuhiro Tajima, Etsuji Tomita
    A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:284-297 [Conf]
  24. Juan Miguel Vilar
    Improve the Learning of Subsequential Transducers by Using Alignments and Dictionaries. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:298-311 [Conf]
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002