Abstract
The problem of k-minimisation for a DFA M is the computation of a smallest DFA N (where the size |M | of a DFA M is the size of the domain of the transition function) such that L(M) Δ L(N) ⊆ ∑
Author supplied keywords
Cite
CITATION STYLE
APA
Gawrychowski, P., Jez, A., & Maletti, A. (2011). On minimising automata with errors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6907 LNCS, pp. 327–338). https://doi.org/10.1007/978-3-642-22993-0_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free