Alternate document: Details Learning Regular Languages From Simple Positive Examples (00) François Denis |
Alternate document: Details Learning from Positive and Unlabeled Examples (00) Fabien Letouzey, François Denis, Rémi Gilleron |
(Enter summary)
Abstract: We define here the Residual Finite State Automata class (RFSA). This class, included in the Non deterministic Finite Automata class, strictly contains the Deterministic Finite Automata class and shares with it a fundamental property: the existence of a canonical minimal form for any regular language. We also define a notion of characteristic sample SL for a given regular language L and a learning algorithm (DeLeTe). We show that DeLeTe can produce the canonical RFSA of a regular language L from ... (Update)
Context of citations to this paper: More
...learned eciently by classical algorithms. It seems natural to learn regular languages using non deterministic representations [CF00,DLT00,Yok94]. We presented in [DLT01] a new class of nondeterministic nite automata, the class of Residual Finite State Automata (RFSAs) based on...
...positifs. Dans le prolongement de ces travaux, nous utilisons ici la notion de langage r esiduel que nous avons d ej a exploit e dans [DLT00], DLT01b] et [DLT01a] a n de d e nir de nouvelles classes de langages identi ables a la limite par exemples positifs seuls. Mots...
Cited by: More
Residual Finite States Automata - Denis, Terlutte (2002)
(Correct)
Some Language Classes Identifiable in the Limit from.. - Denis, Lemay, Terlutte (2002)
(Correct)
Learning Regular Languages Using Non Deterministic Finite.. - Denis, Lemay, Terlutte (2000)
(Correct)
Active bibliography (related documents): More All
0.3: Learning Regular Languages using RFSA - Denis, Lemay, Terlutte (2001)
(Correct)
0.3: Learning Regular Languages using RFSAs - Denis, Lemay, Terlutte (2001)
(Correct)
0.2: Unknown - Ordre Th Ese (2001)
(Correct)
Similar documents based on text: More All
1.5: Residual Finite State Automata - Denis, Lemay, Terlutte (2001)
(Correct)
0.8: Learning Probabilistic Residual Finite State Automata - Esposito, Lemay, Denis, Dupont (2002)
(Correct)
0.6: Efficient Ambiguity Detection in C-NFA: A Step Towards the.. - Coste, Fredouille
(Correct)
Related documents from co-citation: More All
7: Inferring regular languages in polynomial update time (context) - et, -- - 1992
6: Handbook of Formal Languages (context) - Yu - 1997
6: Residual nite state automata (context) - Denis, Lemay et al. - 2001
BibTeX entry: (Update)
F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using non deterministic nite automate. In ICGI 00, 2000. http://citeseer.ist.psu.edu/denis00learning.html More
@inproceedings{ denis00learning,
author = "Fran{\c{c}}ois Denis and Aur{\'e}lien Lemay and Alain Terlutte",
title = "Learning Regular Languages Using Non Deterministic Finite Automata",
booktitle = "Grammatical Inference: {A}lgorithms and {A}pplications, 5th International Colloquium, {ICGI} 2000, Lisbon, Portugal, September 11 - 13, 2000 ; Proceedings",
volume = "1891",
publisher = "Springer, Berlin",
pages = "39--50",
year = "2000",
url = "citeseer.ist.psu.edu/denis00learning.html" }
Citations (may not include all citations):
518
A theory of the learnable (context) - Valiant - 1984 ACM DBLP
176
Cryptographic limitations on learning boolean formulae and n..
- Kearns, Valiant - 1994
49
Inferring regular languages in polynomial update time (context) - Oncina, Garcia - 1992
25
Results of the abbadingo one DFA learning competition and a ..
- Lang, Pearlmutter et al. - 1998 ACM DBLP
17
Teaching a smarter learner
- Goldman, Mathias - 1996 ACM DBLP
17
and Computational Complexity (context) - Pitt, DFAs - 1989
16
Characteristic sets for polynomial grammatical inference
- Higuera - 1997 ACM DBLP
9
Learning regular languages using non deterministic nite auto..
- Denis, Lemay et al. - 2000
9
Complexity of automaton identi cation from given data (context) - Gold - 1978
1
Les automates nis a etats residuels (context) - Denis, Lemay et al. - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.grappa.univ-lille3.fr/~lemay/publi.php3): More
Residual Finite State Automata - Denis, Lemay, Terlutte (2002)
(Correct)
Learning Regular Languages using RFSA - Denis, Lemay, Terlutte (2001)
(Correct)
Residual Finite State Automata - Denis, Lemay, Terlutte (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC