MSO Queries on Tree Decomposable Structures are Computable with Constant Delay - GREYC amacc Access content directly
Conference Papers Year : 2006

MSO Queries on Tree Decomposable Structures are Computable with Constant Delay

Guillaume Bagan
No file

Dates and versions

hal-00195018 , version 1 (08-12-2007)

Identifiers

  • HAL Id : hal-00195018 , version 1

Cite

Guillaume Bagan. MSO Queries on Tree Decomposable Structures are Computable with Constant Delay. Computer Science Logic 2006, 2006, Szeged, Hungary. pp.167-181. ⟨hal-00195018⟩
68 View
0 Download

Share

Gmail Facebook X LinkedIn More