Now showing items 1-2 of 2

  • Antonopoulos, Timos; Hovland, Dag; Martens, Wim; Neven, Frank (Chapter / Bokkapittel / AcceptedVersion; Peer reviewed, 2012)
    Node selecting tree automata (NSTAs) constitute a general formalism defining unary queries over trees. Basically, a node is selected by an NSTA when it is visited in a selecting state during an accepting run. We consider ...
  • Antonopoulos, Timos; Hovland, Dag; Martens, Wim; Neven, Frank (Journal article / Tidsskriftartikkel / AcceptedVersion; Peer reviewed, 2015)
    Node selecting tree automata (NSTAs) constitute a general formalism defining unary queries over trees. Basically, a node is selected by an NSTA when it is visited in a selecting state during an accepting run. We consider ...