Finite automata and unary languages
Theoretical Computer Science
Characteristic Sets for Polynomial Grammatical Inference
Machine Learning
Handbook of formal languages, vol. 1
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
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
Residual Finite State Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Learning Regular Languages Using RFSA
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Learning regular languages using RFSAs
Theoretical Computer Science - Special issue: Algorithmic learning theory
On Rational Stochastic Languages
Fundamenta Informaticae
Four one-shot learners for regular tree languages and their polynomial characterizability
Theoretical Computer Science
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.