Efficient Evaluation of Nondeterministic Automata Using Factorization Forests


In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1 · · · an, does a precomputation, and then answers queries of the form: “is the infix ai · · · aj accepted by A?”. The precomputation is in time poly(A) · n, and the queries are answered in time poly(A). This improves on previous algorithms that worked with the… (More)
DOI: 10.1007/978-3-642-14165-2_44


  • Presentations referencing similar topics