New answers tagged regular-language
1
After more and more digging, here is what I found:
First reference: Introduction to Automata Theory, Languages, and Computation 3rd Edition.
Specifically, theorem 4.26 indicates that the provided algorithm constructs a minimum state machine M for a A such that M has as few states as any DFA equivalent to A.
This was my original understanding, so the answer ...
Top 50 recent answers are included
Related Tags
regular-language × 116automata-theory × 69
fl.formal-languages × 63
reference-request × 18
regular-expressions × 15
context-free × 12
dfa × 12
nondeterminism × 9
ds.algorithms × 8
co.combinatorics × 8
algebra × 8
cc.complexity-theory × 7
computability × 5
omega-language × 5
lo.logic × 4
circuit-complexity × 4
turing-machines × 4
finite-model-theory × 4
monoid × 4
time-complexity × 3
decidability × 3
minimization × 3
complexity-classes × 2
optimization × 2
pl.programming-languages × 2