32 search results - page 2 / 7 » fsttcs 2008 |
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class ...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect informatio...