Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
1 result

FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems

Florent Jacquemard ; Luc Segoufin ; Jerémie Dimino.
A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(<,+1,~) over data trees. Here +1 refers to the child and the next sibling relations while < refers to the&nbsp;[&hellip;]
Published on April 26, 2016

  • < Previous
  • 1
  • Next >