Used together with:
comput
(1)
closur
(1)
automata
(1)
finit
(1)
superword
(1)
Stem
cfls$ (
all stems
)
1 papers:
LATA-2015-BachmeierLS
#automaton
#complexity
#finite
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (
GB
,
ML
,
MS
), pp. 473–485.
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
.