Finite automata and unary languages
Theoretical Computer Science
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 Regular Languages Using Non Deterministic Finite Automata
ICGI '00 Proceedings of the 5th 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
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
On the efficient construction of quasi-reversible automata for reversible languages
Information Processing Letters
Remarks on multiple entry deterministic finite automata
Journal of Automata, Languages and Combinatorics
On Rational Stochastic Languages
Fundamenta Informaticae
On locally reversible languages
Theoretical Computer Science
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Residual languages and probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the use of non-deterministic automata for presburger arithmetic
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Towards dual approaches for learning context-free grammars based on syntactic concept lattices
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Inference of residual finite-state tree automata from membership queries and finite positive data
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Minimalizations of NFA using the universal automaton
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
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 prime residual languages, i.e. that are not the union of other residual languages. We provide an algorithmic construction of the canonical RFSA similar to the subset construction used to build the minimal DFA from a given NFA. We study the size of canonical RFSAs and the complexity of our constructions.