Berglund, MartinDrewes, FVan der Merwe, B2019-03-072019-03-072018-04Berglund, M., Drewes, F. and van der Merwe, B. 2018. The output size problem for string-to-tree transducers. Journal of Automata, Languages and Combinatorics, vol. 23: 19-382567-37851430-189XDOI: 10.25596/jalc-2018-019https://www.jalc.de/issues/2018/issue_23_1-3/jalc-2018-019-038.phphttp://hdl.handle.net/10204/10756Due to copyright restrictions, the attached PDF file contains the accepted version of the published item. The article may be used for non-commercial purposes only.The definitive version is published in Journal of Automata, Languages and Combinatorics. For access to the published version, kindly consult the publisher's website: https://www.jalc.de/issues/2018/issue_23_1-3/jalc-2018-019-038.phpThe 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.enBacktracking regular expression matchersNFA ambiguityOutput sizeString-to-tree transducersArticleBerglund, M., Drewes, F., & Van der Merwe, B. (2018). The output size problem for string-to-tree transducers. http://hdl.handle.net/10204/10756Berglund, Martin, F Drewes, and B Van der Merwe "The output size problem for string-to-tree transducers." (2018) http://hdl.handle.net/10204/10756Berglund M, Drewes F, Van der Merwe B. The output size problem for string-to-tree transducers. 2018; http://hdl.handle.net/10204/10756.TY - Article AU - Berglund, Martin AU - Drewes, F AU - Van der Merwe, B AB - 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. DA - 2018-04 DB - ResearchSpace DP - CSIR KW - Backtracking regular expression matchers KW - NFA ambiguity KW - Output size KW - String-to-tree transducers LK - https://researchspace.csir.co.za PY - 2018 SM - 2567-3785 SM - 1430-189X T1 - The output size problem for string-to-tree transducers TI - The output size problem for string-to-tree transducers UR - http://hdl.handle.net/10204/10756 ER -