Berglund, M. ., Drewes, F. ., & van der Merwe, B. . (2018). The Output Size Problem for String-to-Tree Transducers. Journal of Automata, Languages and Combinatorics, 23(1). Retrieved from https://www.jalc.de/issues/2018/issue_23_1-3/jalc-2018-019-038.php
The output size problem, for a string-to-tree transducer, is to determine the asymptotic behavior of the function describing the maximum size of output trees, with respect to the length of input strings. We show that the problem to determine, for a given regular expression, the worst-case matching time of a backtracking regular expression matcher, can be reduced to the output size problem. The latter can, in turn, be solved by determining the degree of ambiguity of a non-deterministic finite automaton.
Keywords: string-to-tree transducers, output size, backtracking regular expression matchers, NFA ambiguity
@article{201,
author = {Martin Berglund and F. Drewes and Brink van der Merwe},
title = {The Output Size Problem for String-to-Tree Transducers},
abstract = {The output size problem, for a string-to-tree transducer, is to determine the asymptotic behavior of the function describing the maximum size of output trees, with respect to the length of input strings. We show that the problem to determine, for a given regular expression, the worst-case matching time of a backtracking regular expression matcher, can be reduced to the output size problem. The latter can, in turn, be solved by determining the degree of ambiguity of a non-deterministic finite automaton.
Keywords: string-to-tree transducers, output size, backtracking regular expression matchers, NFA ambiguity},
year = {2018},
journal = {Journal of Automata, Languages and Combinatorics},
volume = {23},
pages = {19-38},
issue = {1},
publisher = {Institut für Informatik, Justus-Liebig-Universität Giessen},
address = {Germany},
isbn = {2567-3785},
url = {https://www.jalc.de/issues/2018/issue_23_1-3/jalc-2018-019-038.php},
}