Learning Regular Languages using RFSAs (2001)  (Make Corrections)  (8 citations)
François Denis, Aurélien Lemay, Alain Terlutte
Lecture Notes in Computer Science

  Home/Search   Context   Related   DBLP Metadata

 
View or download:
grappa.univlille3.fr/~le...TCS02.ps.gz
Cached:  PS.gz  PS  PDF  Image  Update  Help

From:  grappa.univlille3.f...publi.php3 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Residual languages are important and natural components of regular languages and several grammatical inference algorithms naturally rely on this notion. In order to identify a given target language, classical inference algorithms try to identify words which give rise to identical residual languages. Here, we study whether it could be interesting to identify inclusion relations between residual languages. We consider the class of RFSAs (Residual Finite State Automata), a class of Non... (Update)

Context of citations to this paper:   More

.... 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 Cl es : inf erence...

...from positive data. In the same framework, we use here the notion of residual languages that we already used in [DLT00] DLT01b] et [DLT01a] to de ne new classes of languages identi able in the limit from positive data. Key Words : grammatical inference, regular languages,...

Cited by:   More
Residual Finite Tree Automata - Carme Gilleron Lemay (2003)   (Correct)
Residual Finite States Automata - Denis, Terlutte (2002)   (Correct)
Some Language Classes Identifiable in the Limit from.. - Denis, Lemay, Terlutte (2002)   (Correct)

Similar documents (at the sentence level):
12.5%:   Learning Regular Languages using RFSA - Denis, Lemay, Terlutte (2001)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Efficient Learning of Some Linear Simple Matrix Languages - Fernau (2000)   (Correct)
0.4:   Learning Probabilistic Residual Finite State Automata - Esposito, Lemay, Denis, Dupont (2002)   (Correct)
0.3:   Quelques Classes De Langages Identifiables à la.. - Denis, Lemay, Terlutte (2002)   (Correct)

Similar documents based on text:   More   All
1.7:   Residual Finite State Automata - Denis, Lemay, Terlutte (2002)   (Correct)
1.4:   Learning Regular Languages Using Non Deterministic Finite.. - Denis, Lemay, Terlutte (2000)   (Correct)

Related documents from co-citation:   More   All
5:   Learning regular languages using non deterministic nite automate - Denis, Lemay et al. - 2000
4:   Handbook of Formal Languages (context) - Yu - 1997
4:   Residual Finite State Automata - Denis, Lemay et al. - 2001

BibTeX entry:   (Update)

Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using RFSA, ALT 2001. http://citeseer.ist.psu.edu/article/denis01learning.html   More

@article{ denis01learning,
    author = "Fran{\c{c}}ois Denis and Aur{\'e}lien Lemay and Alain Terlutte",
    title = "Learning Regular Languages Using {RFSA}",
    journal = "Lecture Notes in Computer Science",
    volume = "2225",
    pages = "348+",
    year = "2001",
    url = "citeseer.ist.psu.edu/article/denis01learning.html" }
Citations (may not include all citations):
1829   Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
228   Learning regular sets from queries and counterexamples (context) - Angluin - 1987
84   Approximate statistical tests for comparing supervised class.. - Dietterich - 1998
63   Derivatives of regular expressions (context) - Brzozowski - 1964
49   Inferring regular languages in polynomial update time (context) - Oncina, Garcia - 1992
45   Random DFA's can be approximately learned from sparse unifor.. - Lang - 1992
25   Results of the Abbadingo one DFA learning competition and a .. - Lang, Pearlmutter et al. - 1998
16   Characteristic sets for polynomial grammatical inference - Higuera - 1997
9   Complexity of automaton identi cation from given data (context) - Gold - 1978
9   Learning regular languages using nondeterministic nite autom.. - Denis, Lemay et al. - 2000
7   Residual nite state automata (context) - Denis, Lemay et al. - 2002
7   Residual nite state automata (context) - Denis, Lemay et al. - 2001
2   Ecient ambiguity detection in c-nfa (context) - Coste, Fredouille - 2000
2   some language classes identi able in the limit from positive.. (context) - Denis, Lemay et al. - 2002
2   Learning non-deterministic nite automata from queries and co.. (context) - Yokomori - 1994
1   Etude du comportement des automates nis et des langages rati.. (context) - Nicaud - 2001
1   Annexes: Variation of parameters for NFAs generation (context) - Yu, Formal et al. - 1997



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