Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540410119, 9783540452577

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Smoothing Probabilistic Automata: An Error-Correcting Approach

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45257-7_5 ◽

2000 ◽

pp. 51-64 ◽

Cited By ~ 8

Author(s):

Pierre Dupont ◽

Juan-Carlos Amengual

Keyword(s):

Probabilistic Automata

On the Complexity of Consistent Identification of Some Classes of Structure Languages

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45257-7_8 ◽

2000 ◽

pp. 89-102 ◽

Cited By ~ 2

Author(s):

Christophe Costa Florêncio

A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45257-7_23 ◽

2000 ◽

pp. 284-297 ◽

Cited By ~ 1

Author(s):

Yasuhiro Tajima ◽

Etsuji Tomita

Keyword(s):

Polynomial Time ◽

Representative Sample ◽

Learning Algorithm ◽

Membership Queries ◽

Polynomial Time Learning ◽

Simple Deterministic Languages

The Induction of Temporal Grammatical Rules from Multivariate Time Series

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45257-7_11 ◽

2000 ◽

pp. 127-140 ◽

Cited By ~ 5

Author(s):

G. Guimarães

Keyword(s):

Time Series ◽

Multivariate Time Series

Identification of Tree Translation Rules from Examples

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45257-7_20 ◽

2000 ◽

pp. 241-255 ◽

Cited By ~ 4

Author(s):

Hiroshi Sakamoto ◽

Hiroki Arimura ◽

Setsuo Arikawa

Efficient Ambiguity Detection in C-NFA

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45257-7_3 ◽

2000 ◽

pp. 25-38 ◽

Cited By ~ 6

Author(s):

François Coste ◽

Daniel Fredouille

Keyword(s):

Ambiguity Detection

Computation of Substring Probabilities in Stochastic Grammars

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45257-7_9 ◽

2000 ◽

pp. 103-114 ◽

Cited By ~ 5

Author(s):

Ana L. N. Fred

Keyword(s):

Stochastic Grammars

Computational Complexity of Problems on Probabilistic Grammars and Transducers

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45257-7_2 ◽

2000 ◽

pp. 15-24 ◽

Cited By ~ 18

Author(s):

Francisco Casacuberta ◽

Colin de la Higuera

Keyword(s):

Computational Complexity ◽

Probabilistic Grammars

On the Relationship between Models for Learning in Helpful Environments

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45257-7_17 ◽

2000 ◽

pp. 207-220 ◽

Cited By ~ 5

Author(s):

Rajesh Parekh ◽

Vasant Honavar

Keyword(s):

The Relationship

Permutations and Control Sets for Learning Non-regular Language Families

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45257-7_7 ◽

2000 ◽

pp. 75-88 ◽

Cited By ~ 7

Author(s):

Henning Fernau ◽

José M. Sempere

Keyword(s):

Regular Language ◽

Control Sets ◽

And Control

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Smoothing Probabilistic Automata: An Error-Correcting Approach

On the Complexity of Consistent Identification of Some Classes of Structure Languages

A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample

The Induction of Temporal Grammatical Rules from Multivariate Time Series

Identification of Tree Translation Rules from Examples

Efficient Ambiguity Detection in C-NFA

Computation of Substring Probabilities in Stochastic Grammars

Computational Complexity of Problems on Probabilistic Grammars and Transducers

On the Relationship between Models for Learning in Helpful Environments

Permutations and Control Sets for Learning Non-regular Language Families

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science
Latest Publications