| F. Coste and D. Fredouille. Ecient ambiguity detection in c-nfa. In Grammatical Inference: Algorithms and Applications, volume 1891 of Lecture Notes in Arti cial Intelligence. Springer Verlag, 2000. |
....optimal way to represent regular languages. The size of the minimal DFA of languages as simple as is exponential with respect to n. Thus these languages cannot be 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 the notion of residual languages. The residual language of a language L with regard to a word u is the set of words v such that uv is in L. As it is stated by the ....
F. Coste and D. Fredouille. Ecient ambiguity detection in c-nfa. In Grammatical Inference: Algorithms and Applications, volume 1891 of Lecture Notes in Arti cial Intelligence. Springer Verlag, 2000.
....way of representing regular languages: the size of minimal DFA of languages as simple as is exponential with respect to n: thus these languages cannot be learned by classical algorithms in reasonable time. It seems natural to learn regular languages using non deterministic representations [CF00], DLT00] We presented in [DLT01] a new class of non deterministic nite automata, the class of Residual Finite State Automata (RFSA) The residual language of a language L with regard to a word u is the set of words v such that uv is in L. The number of distinct residual languages of a regular ....
F. Coste and D. Fredouille. Ecient ambiguity detection in c-nfa. In Grammatical Inference: Algorithms and Applications, volume 1891 of Lecture Notes in Arti cial Intelligence. Springer Verlag, 2000.
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