Characteristic Sets for Polynomial Grammatical Inference
Machine Learning
Handbook of formal languages, vol. 1
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Learning Probabilistic Residual Finite State Automata
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Some Classes of Regular Languages Identifiable in the Limit from Positive Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning Regular Languages Using RFSA
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
A randomised inference algorithm for regular tree languages
Natural Language Engineering
Inference improvement by enlarging the training set while learning DFAs
CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
Model-checking in-lined reference monitors
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Some minimality results on biresidual and biseparable automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Minimal DFA for symmetric difference NFA
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Residual Finite State Automata
Fundamenta Informaticae
| Hi-index | 0.00 |
We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover, this canonical RFSA may be exponentially smaller than the equivalent minimal DFA but it also may have the same number of states as the equivalent minimal DFA, even if minimal equivalent NFA are exponentially smaller. We provide an algorithm that computes the canonical RFSA equivalent to a given NFA. We study the complexity of several decision and construction problems linked to the class of RFSA: most of them are PSPACE-complete.