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

DOI10.2168/LMCS-12(2:3)2016zbMath1448.68227arXiv1601.01579MaRDI QIDQ2804201

Luc Segoufin, Jérémie Dimino, Florent Jacquemard

Publication date: 28 April 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.01579

zbMATH Keywords

data automatatwo-variable logiccounter automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Data structures (68P05)

Related Items (4)

Logics of Repeating Values on Data Trees and Branching Counter Systems ⋮ ML and Extended Branching VASS ⋮ On regular paths with counting and data tests ⋮ Forward analysis for WSTS, part I: completions

This page was built for publication: FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems