Used together with:
effici
(1)
express
(1)
seri
(1)
memori
(1)
regular
(1)
Stem
sdfa$ (
all stems
)
1 papers:
CIAA-2012-LiuSGF
#automaton
#named
#regular expression
SDFA: Series DFA for Memory-Efficient Regular Expression Matching (
TL
,
YS
,
LG
,
BF
), pp. 337–344.
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
.