2025
Finite-valued Streaming String Transducers.
TheoretiCS, 2025
2024
Constructing Deterministic Parity Automata from Positive and Negative Examples.
TheoretiCS, 2024
On the Boolean Closure of Deterministic Top-Down Tree Automata.
Int. J. Found. Comput. Sci., 2024
2023
A First-order Logic with Frames.
ACM Trans. Program. Lang. Syst., June, 2023
Resynchronized Uniformization and Definability Problems for Rational Relations.
Discret. Math. Theor. Comput. Sci., 2023
A Regular and Complete Notion of Delay for Streaming String Transducers.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
2022
Model-guided synthesis of inductive lemmas for FOL with least fixpoints.
Proc. ACM Program. Lang., 2022
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don't Care Words.
Fundam. Informaticae, 2022
Passive Learning of Deterministic Büchi Automata by Combinations of DFAs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2021
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021
Automata on finite trees.
Proceedings of the Handbook of Automata Theory., 2021
Automata on infinite trees.
Proceedings of the Handbook of Automata Theory., 2021
2020
Projection for Büchi Tree Automata with Constraints between Siblings.
Int. J. Found. Comput. Sci., 2020
Synthesizing Lemmas for Inductive Reasoning.
CoRR, 2020
Synthesis from Weighted Specifications with Partial Domains over Finite Words.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2020
State Space Reduction For Parity Automata.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020
2019
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words.
Discret. Math. Theor. Comput. Sci., 2019
Tree Automata with Global Constraints for Infinite Trees.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019
New Pumping Technique for 2-Dimensional VASS.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
New Optimizations and Heuristics for Determinization of Büchi Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2019
2018
Foundations for natural proofs and quantifier instantiation.
Proc. ACM Program. Lang., 2018
Pure Strategies in Imperfect Information Stochastic Games.
Fundam. Informaticae, 2018
On Finitely Ambiguous Büchi Automata.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018
2017
Learning MSO-definable hypotheses on string.
CoRR, 2017
Learning MSO-definable hypotheses on strings.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017
2016
Abstract Learning Frameworks for Synthesis.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016
Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
Transformation Between Regular Expressions and omega-Automata.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
On Equivalence and Uniformisation Problems for Finite Transducers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Simplification Problems for Deterministic Pushdown Automata on Infinite Words.
Int. J. Found. Comput. Sci., 2015
Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists.
Formal Methods Syst. Des., 2015
A Unified Approach to Boundedness Properties in MSO.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015
2014
Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations.
Proceedings of the Proceedings Fifth International Symposium on Games, 2014
Decision Problems for Deterministic Pushdown Automata on Infinite Words.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014
Definability and Transformations for Cost Logics and Automatic Structures.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
Guaranteeing Stability and Delay in Dynamic Networks Based on Infinite Games.
Proceedings of the 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2014
ICE: A Robust Framework for Learning Invariants.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014
2013
Modeling and Verification of Infinite Systems with Resources.
Log. Methods Comput. Sci., 2013
Decidability Results on the Existence of Lookahead Delegators for NFA.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013
Unambiguous Finite Automata.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013
Deciding the weak definability of Büchi definable tree languages.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013
Learning Universally Quantified Invariants of Linear Data Structures.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013
2012
Efficient inclusion testing for simple classes of unambiguous ω-automata.
Inf. Process. Lett., 2012
Regularity Problems for Weak Pushdown ω-Automata and Games.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
Improved Ramsey-Based Büchi Complementation.
Proceedings of the Foundations of Software Science and Computational Structures, 2012
Proceedings of the Modern Applications of Automata Theory., 2012
2011
Degrees of Lookahead in Context-free Infinite Games.
Proceedings of the Computer Science Logic, 2011
Infinite games and automata theory.
Proceedings of the Lectures in Game Theory for Computer Scientists., 2011
2010
Regular Cost Functions over Finite Trees.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata.
Proceedings of the Language and Automata Theory and Applications, 2010
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010
2009
On Nondeterministic Unranked Tree Automata with Sibling Constraints.
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.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008
Logical theories and compatible operations.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008
2007
Transforming structures by set interpretations.
Log. Methods Comput. Sci., 2007
Propositional dynamic logic with recursive programs.
J. Log. Algebraic Methods Program., 2007
Memory Reduction for Strategies in Infinite Games.
Proceedings of the Implementation and Application of Automata, 2007
Transition Graphs of Rewriting Systems over Unranked Trees.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
Unranked Tree Automata with Sibling Equalities and Disequalities.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007
MSO on the Infinite Binary Tree: Choice and Order.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007
2006
Reachability Problems on Regular Ground Tree Rewriting Graphs.
Theory Comput. Syst., 2006
A characterization of first-order topological properties of planar spatial data.
J. ACM, 2006
Regularity Problems for Visibly Pushdown Languages.
Proceedings of the STACS 2006, 2006
Propositional Dynamic Logic with Recursive Programs.
Proceedings of the Foundations of Software Science and Computation Structures, 2006
2005
Deterministic Automata on Unranked Trees.
Proceedings of the Foundations of Semistructured Data, 6.-11. February 2005, 2005
2004
Synthesis of Open Reactive Systems from Scenario-Based Specifications.
Fundam. Informaticae, 2004
On the Expressiveness of Deterministic Transducers over Infinite Trees.
Proceedings of the STACS 2004, 2004
A Characterization of First-Order Topological Properties of Planar Spatial Data.
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004
2003
Solving the Sabotage Game Is PSPACE-Hard.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
Model Checking and Satisfiability for Sabotage Modal Logic.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003
2002
Ground Tree Rewriting Graphs of Bounded Tree Width.
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.
Proceedings of the Foundations of Software Science and Computation Structures, 2002
2001
Efficient minimization of deterministic weak omega-automata.
Inf. Process. Lett., 2001
2000
Alternating Automata and Logics over Infinite Words.
Proceedings of the Theoretical Computer Science, 2000
1999
Optimal Bounds for Transformations of omega-Automata.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999