GENERAL ENQUIRIES: Tel: + 27 12 841 2911 | Email:

Show simple item record Berglund, Martin Drewes, F Van der Merwe, B 2019-03-07T12:13:06Z 2019-03-07T12:13:06Z 2018-04
dc.identifier.citation Berglund, 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-38 en_US
dc.identifier.issn 2567-3785
dc.identifier.issn 1430-189X
dc.identifier.uri DOI: 10.25596/jalc-2018-019
dc.description Due 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: en_US
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher Institut für Informatik en_US
dc.relation.ispartofseries Worklist;22096
dc.subject Backtracking regular expression matchers en_US
dc.subject NFA ambiguity en_US
dc.subject Output size en_US
dc.subject String-to-tree transducers en_US
dc.title The output size problem for string-to-tree transducers en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ResearchSpace

Advanced Search


My Account