The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thierry Cachat: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  13. Tree Automata Make Ordinal Theory Easy. [Citation Graph (, )][DBLP]


Search in 0.146secs, Finished in 0.148secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002