Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. ICGI 1998: Ames, Iowa, USA
- Vasant G. Honavar
, Giora Slutzki:
Grammatical Inference, 4th International Colloquium, ICGI-98, Ames, Iowa, USA, July 12-14, 1998, Proceedings. Lecture Notes in Computer Science 1433, Springer 1998, ISBN 3-540-64776-7 - Kevin J. Lang, Barak A. Pearlmutter, Rodney A. Price:
Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm. 1-12 - Peter Rossmanith, Thomas Zeugmann:
Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data. 13-24 - Isabelle Tellier:
Meaning Helps Learning Syntax. 25-36 - Rajesh Parekh, Codrin M. Nichitiu, Vasant G. Honavar:
A Polynominal Time Incremental Algorithm for Learning DFA. 37-49 - José Oncina:
The Data Driven Approach Applied to the OSTIA Algorithm. 50-56 - Vlado Keselj:
Grammar Model and Grammar Induction in the System NL PAGE. 57-66 - Antonio Castellanos:
Approximate Learning of Random Subsequential Transducers. 67-78 - Colin de la Higuera:
Learning Stochastic Finite Automata from Experts. 79-89 - Laura Firoiu, Tim Oates, Paul R. Cohen:
Learning Deterministic Finite Automaton with a Recurrent Neural Network. 90-101 - Jacques Chodorowski, Laurent Miclet:
Applying Grammatical Inference in Learning a Language Model for Oral Dialogue. 102-113 - Jerome A. Feldman:
Real Language Learning. 114-125 - Hugues Juillé, Jordan B. Pollack:
A Stochastic Search Approach to Grammar Induction. 126-137 - David Picó, Enrique Vidal:
Transducer-Learning Experiments on Language Understanding. 138-149 - José Ruiz, Salvador España Boquera, Pedro García:
Locally Threshold Testable Languages in Strict Sense: Application to the Inference Problem. 150-161 - José M. Sempere, G. Nagaraja:
Learning a Subclass of Linear Languages from Positive Structural Information. 162-174 - Alexander S. Saidi, Souad Tayeb-bey:
Grammatical Inference in Document Recognition. 175-186 - Rafael C. Carrasco, José Oncina, Jorge Calera-Rubio:
Stochastic Inference of Regular Tree Languages. 187-198 - François Coste, Jacques Nicolas:
How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree. 199-210 - Pedro P. Cruz-Alcázar, Enrique Vidal:
Learning Regular Grammars to Model Musical Style: Comparing Different Coding Schemes. 211-222 - J. D. Emerald, K. G. Subramanian, D. Gnanaraj Thomas:
Learning a Subclass of Context-Free Languages. 223-231 - Pierre Dupont, Lin Lawrence Chase:
Using Symbol Clustering to Improve Probabilistic Automaton Inference. 232-243 - Peter Viechnicki:
A Performance Evaluation of Automatic Survey Classifiers. 244-256 - Alvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen:
Pattern Discovery in Biosequences. 257-270
a service of 
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-05-10 18:45 CEST 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:
