Publications of Thierry Cachat

Publications at Chair of Computer Science 7

[Cac03a] T. Cachat. Games on pushdown graphs and extensions. PhD thesis, RWTH Aachen, 2003.
[ pdf | http | Abstract ]
[Cac03b] T. Cachat. Higher order pushdown automata, the Caucal hierarchy of graphs and parity games. In Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, volume 2719 of Lecture Notes in Computer Science, pages 556-569. Springer, 2003. (c) Springer.
[ pdf | ps | Abstract ]
[Cac02a] T. Cachat. The power of one-letter rational languages. In Proceedings of the 5th international conference Developments in Language Theory, volume 2295 of Lecture Notes in Computer Science, pages 145-154. Springer, 2002. (c) Springer.
[ pdf | ps | Abstract ]
[Cac02b] T. Cachat. Symbolic strategy synthesis for games on pushdown graphs. In Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 704-715. Springer, 2002. (c) Springer.
[ pdf | ps | Abstract ]
[Cac02c] T. Cachat. Two-way tree automata solving pushdown games. In E. Grädel, W. Thomas, and T. Wilke, editors, Automata, Logics, and Infinite Games [?], volume 2500 of Lecture Notes in Computer Science, pages 303-317. Springer, 2002. (c) Springer.
[ pdf | ps | Abstract ]
[Cac02d] T. Cachat. Uniform solution of parity games on prefix-recognizable graphs. In Antonin Kucera and Richard Mayr, editors, Proceedings of the 4th International Workshop on Verification of Infinite-State Systems, volume 68 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002. (c) Elsevier Science.
[ pdf | ps | Abstract ]
[CDT02] T. Cachat, J. Duparc, and W. Thomas. Solving pushdown games with a sigma_3 winning condition. In Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic, CSL 2002, volume 2471 of Lecture Notes in Computer Science, pages 322-336. Springer, 2002. (c) Springer.
[ pdf | ps | Abstract ]
[Cac01] T. Cachat. The power of one-letter rational languages. Technical Report AIB-03-2001, RWTH Aachen, 2001. Preliminary version of [Cac02a].
[ ps | Abstract ]