32 search results - page 3 / 7 » fsttcs 2008 |
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a languag...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
The unfolding of (1-)safe Petri nets to occurrence nets is well understood. There is a universal characterization of the unfolding of a safe net which is part and parcel of a core...