The following pages link to XPath evaluation in linear time (Q5395662):
Displaying 5 items.
- Deciding twig-definability of node selecting tree automata (Q269327) (← links)
- The factorisation forest theorem (Q2074219) (← links)
- Regular expressions for data words (Q2353403) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
