The basis automaton for the given regular language
ω-automaton
Basis (linear algebra)
Timed automaton
Büchi automaton
DFA minimization
Probabilistic automaton
Deterministic finite automaton
DOI:
10.1007/bf03009953
Publication Date:
2019-09-27T03:17:48Z
AUTHORS (1)
ABSTRACT
A new problem of the theory of finite automata (Rabin-Scott’s automata) is considered. So called basis automaton for the given regular languageL is defined.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (3)
CITATIONS (3)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....