Used together with:
tight
(1)
transform
(1)
binari
(1)
alphabet
(1)
nfa
(1)
Stem
dfca$ (
all stems
)
1 papers:
CIAA-2004-CampeanuP
#automaton
#bound
#nondeterminism
Tight Bounds for NFA to DFCA Transformations for Binary Alphabets (
CC
,
AP
), pp. 306–307.
Bibliography of Software Language Engineering in Generated Hypertext
(
BibSLEIGH
) is created and maintained by
Dr. Vadim Zaytsev
.
Hosted as a part of
SLEBOK
on
GitHub
.