Christof Löding

P. Madhusudan

Daniel Neider

Formal Methods Syst. Des., 2015

A Unified Approach to Boundedness Properties in MSO.

[BibT_eX]

[DOI]

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations.

[BibT_eX]

[DOI]

Sarah Winter

Proceedings of the Proceedings Fifth International Symposium on Games, 2014

Decision Problems for Deterministic Pushdown Automata on Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Definability and Transformations for Cost Logics and Automatic Structures.

[BibT_eX]

[DOI]

Martin Lang

Amaldev Manuel

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Guaranteeing Stability and Delay in Dynamic Networks Based on Infinite Games.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2014

ICE: A Robust Framework for Learning Invariants.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013

Modeling and Verification of Infinite Systems with Resources.

[BibT_eX]

[DOI]

Martin Lang

Log. Methods Comput. Sci., 2013

Decidability Results on the Existence of Lookahead Delegators for NFA.

[BibT_eX]

[DOI]

Stefan Repke

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Unambiguous Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Deciding the weak definability of Büchi definable tree languages.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

Learning Universally Quantified Invariants of Linear Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012

Efficient inclusion testing for simple classes of unambiguous ω-automata.

[BibT_eX]

[DOI]

Dimitri Isaak

Inf. Process. Lett., 2012

Regularity Problems for Weak Pushdown ω-Automata and Games.

[BibT_eX]

[DOI]

Stefan Repke

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Improved Ramsey-Based Büchi Complementation.

[BibT_eX]

[DOI]

Stefan Breuers

Jörg Olschewski

Proceedings of the Foundations of Software Science and Computational Structures, 2012

Basics on Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Modern Applications of Automata Theory., 2012

2011

Degrees of Lookahead in Context-free Infinite Games.

[BibT_eX]

[DOI]

Wladimir Fridman

Martin Zimmermann

Proceedings of the Computer Science Logic, 2011

Infinite games and automata theory.

[BibT_eX]

Proceedings of the Lectures in Game Theory for Computer Scientists., 2011

2010

Regular Cost Functions over Finite Trees.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata.

[BibT_eX]

[DOI]

Nicolas Bousquet

Proceedings of the Language and Automata Theory and Applications, 2010

Obliging Games.

[BibT_eX]

[DOI]

Krishnendu Chatterjee

Florian Horn

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

On Nondeterministic Unranked Tree Automata with Sibling Constraints.

[BibT_eX]

[DOI]

Karianto Wong

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008

The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

Logical theories and compatible operations.

[BibT_eX]

Achim Blumensath

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

Transforming structures by set interpretations.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

Propositional dynamic logic with recursive programs.

[BibT_eX]

[DOI]

Carsten Lutz

J. Log. Algebraic Methods Program., 2007

Memory Reduction for Strategies in Infinite Games.

[BibT_eX]

[DOI]

Michael Holtmann

Proceedings of the Implementation and Application of Automata, 2007

Transition Graphs of Rewriting Systems over Unranked Trees.

[BibT_eX]

[DOI]

Alex Spelten

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Unranked Tree Automata with Sibling Equalities and Disequalities.

[BibT_eX]

[DOI]

Karianto Wong

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

MSO on the Infinite Binary Tree: Choice and Order.

[BibT_eX]

[DOI]

Arnaud Carayol

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

Reachability Problems on Regular Ground Tree Rewriting Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

A characterization of first-order topological properties of planar spatial data.

[BibT_eX]

[DOI]

J. ACM, 2006

Regularity Problems for Visibly Pushdown Languages.

[BibT_eX]

[DOI]

Vince Bárány

Proceedings of the STACS 2006, 2006

Propositional Dynamic Logic with Recursive Programs.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005

Deterministic Automata on Unranked Trees.

[BibT_eX]

[DOI]

Wolfgang Thomas

Julien Cristau

Proceedings of the Foundations of Semistructured Data, 6.-11. February 2005, 2005

2004

Synthesis of Open Reactive Systems from Scenario-Based Specifications.

[BibT_eX]

[DOI]

Yves Bontemps

Pierre-Yves Schobbens

Fundam. Informaticae, 2004

On the Expressiveness of Deterministic Transducers over Infinite Trees.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

A Characterization of First-Order Topological Properties of Planar Spatial Data.

[BibT_eX]

[DOI]

Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

Visibly Pushdown Games.

[BibT_eX]

[DOI]

P. Madhusudan

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003

Solving the Sabotage Game Is PSPACE-Hard.

[BibT_eX]

[DOI]

Philipp Rohde

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Model Checking and Satisfiability for Sabotage Modal Logic.

[BibT_eX]

[DOI]

Philipp Rohde

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Ground Tree Rewriting Graphs of Bounded Tree Width.

[BibT_eX]

[DOI]

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Model-Checking Infinite Systems Generated by Ground Tree Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001

Efficient minimization of deterministic weak omega-automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

2000

Alternating Automata and Logics over Infinite Words.

[BibT_eX]

[DOI]

Wolfgang Thomas

Proceedings of the Theoretical Computer Science, 2000

1999

Optimal Bounds for Transformations of omega-Automata.

[BibT_eX]

[DOI]