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

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(

Saved in:
Bibliographic Details
Published in:Logical methods in computer science 2016-01, Vol.12, Issue 2 (2)
Main Authors: Jacquemard, Florent, Segoufin, Luc, Dimino, Jerémie
Format: Article
Language:English
Subjects:
Computation and Language
Computer Science
computer science - formal languages and automata theory
Logic in Computer Science
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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(
ISSN:1860-5974
1860-5974
DOI:10.2168/LMCS-12(2:3)2016