Number of documents

3


"Hubert Comon-Lundh"   

Journal articles2 documents

  • Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin. Visibly Tree Automata with Memory and Constraints. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2008, 4 (2), ⟨10.2168/LMCS-4(2:8)2008⟩. ⟨inria-00578844⟩
  • Hubert Comon-Lundh, Florent Jacquemard. Ground Reducibility is EXPTIME-complete. Information and Computation, Elsevier, 2003, 187 (1), pp.123-153. ⟨inria-00578859⟩

Conference papers1 document

  • Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin. Tree Automata with Memory, Visibility and Structural Constraints. 10th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), Mar 2007, Braga, Portugal. pp.168-182, ⟨10.1007/978-3-540-71389-0_13⟩. ⟨inria-00579009⟩