DECIDING DEFINABILITY IN FO 2 (< v , < h ) ON TREES - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2015

DECIDING DEFINABILITY IN FO 2 (< v , < h ) ON TREES

Abstract

We provide a decidable characterization of regular forest languages definable in FO 2 (
Fichier principal
Vignette du fichier
fodeux-char.pdf (570.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01223373 , version 1 (02-11-2015)

Identifiers

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

Altmetric

Share

Gmail Facebook X LinkedIn More