François Denis, Aurélien Lemay, Alain Terlutte  Home/Search
Context Related
Links: ACM DBLP | grappa.univlille3.fr/~lem...FI02.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: grappa.univlille3.f...publi.php3 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We define a new variety of Nondeterministic Finite Automata (NFA): a Residual Finite State Automaton (RFSA) is an NFA all the states of which define residual languages of the language L that it recognizes ; a residual language according to a word u is the set of words v such that uv is in L. We prove that every regular language is recognized by a unique (canonical) RFSA which has a minimal number of states and a maximal number of transitions. Canonical RFSAs are based on the notion of... (Update)
Context of citations to this paper: More
...languages of the language it recognizes. We call Residual Finite State Automata (RFSA) such automata. RFSAs have been introduced in [5].Clearly, all DFAs are RFSAs but the converse is false. We show that we can naturally associate with every regular language L an RFSA...
Cited by: More
Residual Finite Tree Automata - Carme, Gilleron, Lemay, Terlutte.. (2003) (Correct)
Residual Finite States Automata - Denis, Terlutte (2002) (Correct)
Residual Finite State Automata - Denis, Lemay, Terlutte (2002) (Correct)
Active bibliography (related documents): More All
0.3: Some Language Classes Identifiable in the Limit from.. - Denis, Lemay, Terlutte (2002) (Correct)
0.3: Quelques Classes De Langages Identifiables à la.. - Denis, Lemay, Terlutte (2002) (Correct)
0.3: Memory Ushering in a Scalable Computing Cluster - Barak (1997) (Correct)
Similar documents based on text: More All
1.7: Learning Regular Languages using RFSAs - Denis, Lemay, Terlutte (2001) (Correct)
0.8: Learning Regular Languages Using Non Deterministic Finite.. - Denis, Lemay, Terlutte (2000) (Correct)
0.6: Computing Small Nondeterministic Finite Automata - Matz, Potthoff (1995) (Correct)
Related documents from co-citation: More All
4: Learning regular languages using RFSA - Denis, Lemay et al. - 2001
2: Learning regular languages using non deterministic nite automate - Denis, Lemay et al. - 2000
2: Canonical regular expressions and minimal state graphs for definite events (context) - Brzozowski - 1962
BibTeX entry: (Update)
Denis, F., Lemay, A., Terlutte, A.: Residual Finite State Automata, STACS 2001. http://citeseer.ist.psu.edu/article/denis02residual.html More
@article{ denis01residual,
author = "Fran{\c{c}}ois Denis and Aur{\'e}lien Lemay and Alain Terlutte",
title = "Residual Finite State Automata",
journal = "Lecture Notes in Computer Science",
volume = "2010",
pages = "144--??",
year = "2001",
url = "citeseer.ist.psu.edu/article/denis02residual.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
192 Representation of Events in Nerve Nets and Finite Automata (context) - Kleene - 1956
127 Complexity of Automaton Identification from Given Data (context) - Gold - 1978 DBLP
53 Inferring regular languages in polynomial update time (context) - Oncina, Garcia - 1992
38 Linear Automaton Transformation (context) - Nerode - 1958
16 Characteristic Sets for Polynomial Grammatical Inference - Higuera - 1997
14 Canonical regular expressions and minimal state graphs for d.. (context) - Brzozowski - 1962
14 Finite Automata and the Representation of Events (context) - Myhill - 1957
9 Learning regular languages using non deterministic finite au.. - Denis, Lemay et al. - 2000
8 Handbook of Formal Languages (context) - Yu - 1997
8 Learning regular languages using RFSA - Denis, Lemay et al. - 2001
4 Residual Finite State Automata - Denis, Lemay et al. - 2001
3 a Guide to the Theory of NP-Completness (context) - Garey, Johnson - 1979
2 Theorical Computer Science (context) - Chrobak - 1986
Documents on the same site (http://www.grappa.univ-lille3.fr/~lemay/publi.php3): More
Learning Regular Languages using RFSA - Denis, Lemay, Terlutte (2001) (Correct)
Residual Finite State Automata - Denis, Lemay, Terlutte (2001) (Correct)
Learning Regular Languages using RFSAs - 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