DECIDING DEFINABILITY IN FO 2 (< v , < h ) ON TREES
Abstract
We provide a decidable characterization of regular forest languages definable in FO 2 (
Domains
Computation and Language [cs.CL]
Origin : Files produced by the author(s)
Loading...
Luc Segoufin : Connect in order to contact the contributor
https://inria.hal.science/hal-01223373
Submitted on : Monday, November 2, 2015-3:24:40 PM
Last modification on : Friday, March 24, 2023-2:53:01 PM
Long-term archiving on: Wednesday, February 3, 2016-10:52:34 AM
Cite
Thomas Place, Luc Segoufin. DECIDING DEFINABILITY IN FO 2 (< v , < h ) ON TREES. Logical Methods in Computer Science, 2015, 11 (3), ⟨10.2168/LMCS-11(3:5)2015⟩. ⟨hal-01223373⟩
101
View
83
Download