BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Italy
1 × The Netherlands
Collaborated with:
S.Tison M.Tommasi B.Bogaert R.Treinen A.Caron
Talks about:
constraint (1) comparison (1) structur (1) recogniz (1) quantifi (1) automata (1) undecid (1) satisfi (1) problem (1) formula (1)

Person: Franck Seynhaeve

DBLP DBLP: Seynhaeve:Franck

Contributed to:

FoSSaCS 19991999
RTA 19991999
TAPSOFT CAAP/FASE 19971997

Wrote 3 papers:

FoSSaCS-1999-BogaertST #automaton #problem
The Recognizability Problem for Tree Automata with Comparisons between Brothers (BB, FS, ST), pp. 150–164.
RTA-1999-CaronSTT #quantifier #satisfiability
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting (ACC, FS, ST, MT), pp. 103–117.
TAPSOFT-1997-SeynhaeveTT #constraints #decidability #grid
Grid Structure and Undecidable Constraint Theories (FS, MT, RT), pp. 357–368.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.