2007 |
13 | EE | Eugene Asarin,
Thierry Cachat,
Alexander Seliverstov,
Tayssir Touili,
Vassily A. Lyubetsky:
Attenuation Regulation as a Term Rewriting System.
AB 2007: 81-94 |
12 | EE | Thierry Cachat:
Tree Automata Make Ordinal Theory Easy.
Algorithmic-Logical Theory of Infinite Structures 2007 |
11 | EE | Thierry Cachat,
Igor Walukiewicz:
The Complexity of Games on Higher Order Pushdown Automata
CoRR abs/0705.0262: (2007) |
2006 |
10 | EE | Thierry Cachat:
Controller Synthesis and Ordinal Automata.
ATVA 2006: 215-228 |
9 | EE | Thierry Cachat:
Tree Automata Make Ordinal Theory Easy.
FSTTCS 2006: 285-296 |
8 | EE | Thierry Cachat:
Controller synthesis & Ordinal Automata
CoRR abs/cs/0608120: (2006) |
7 | EE | Thierry Cachat:
Tree Automata Make Ordinal Theory Easy
CoRR abs/cs/0610166: (2006) |
2003 |
6 | EE | Thierry Cachat:
Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games.
ICALP 2003: 556-569 |
2002 |
5 | EE | Thierry Cachat,
Jacques Duparc,
Wolfgang Thomas:
Solving Pushdown Games with a Sigma3 Winning Condition.
CSL 2002: 322-336 |
4 | EE | Thierry Cachat:
Symbolic Strategy Synthesis for Games on Pushdown Graphs.
ICALP 2002: 704-715 |
3 | EE | Thierry Cachat:
Uniform Solution of Parity Games on Prefix-Recognizable Graphs.
Electr. Notes Theor. Comput. Sci. 68(6): (2002) |
2001 |
2 | EE | Thierry Cachat:
Two-Way Tree Automata Solving Pushdown Games.
Automata, Logics, and Infinite Games 2001: 303-317 |
1 | EE | Thierry Cachat:
The Power of One-Letter Rational Languages.
Developments in Language Theory 2001: 145-154 |