International audienceWe provide a benchmark collection of deterministic automatafor regular XPath queries. For this, we select the subcollection offorward navigational XPath queries from a corpus that Lick and Schmitzextracted from real-world XSLT and XQuery programs, compile them tostepwise hedge automata (SHAs), and determinize them. Large blowups by automatadeterminization are avoided by using schema-based determinization. The schemacaptures the \XML data model and the fact thatany answer of a path query must return a single node.Our collection also provides deterministic nested word automatathat we obtain by compilation from deterministic SHAs
