| Publication | Date of Publication | Type |
|---|
| Weakly-unambiguous Parikh automata and their link to holonomic series | 2026-03-18 | Paper |
| The structure of trees in the pushdown hierarchy | 2026-01-14 | Paper |
Random deterministic automata with one added transition
Logical Methods in Computer Science | 2025-03-06 | Paper |
| One drop of non-determinism in a random deterministic automaton | 2024-10-08 | Paper |
| Higher-order recursion schemes and their automata models | 2021-11-12 | Paper |
| Optimal strategies in pushdown reachability games | 2021-08-04 | Paper |
| scientific article; zbMATH DE number 7361952 (Why is no real title available?) | 2021-06-22 | Paper |
scientific article; zbMATH DE number 7361952 (Why is no real title available?)
(available as arXiv preprint) | 2021-06-22 | Paper |
How Good Is a Strategy in a Game with Nature?
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
On long words avoiding Zimin patterns
Theory of Computing Systems | 2019-08-27 | Paper |
Pure Strategies in Imperfect Information Stochastic Games
Fundamenta Informaticae | 2018-10-26 | Paper |
How good is a strategy in a game with Nature?
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Automata on infinite trees with equality and disequality constraints between siblings
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
On Long Words Avoiding Zimin Patterns
(available as arXiv preprint) | 2018-04-19 | Paper |
Erratum for “Randomization in Automata on Infinite Trees”
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
| scientific article; zbMATH DE number 6741931 (Why is no real title available?) | 2017-07-11 | Paper |
Collapsible pushdown automata and labeled recursion schemes, equivalence, safety and effective selection
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Counting branches in trees using games
Information and Computation | 2016-12-22 | Paper |
An analysis of the equational properties of the well-founded fixed point
Journal of Logical and Algebraic Methods in Programming | 2016-11-30 | Paper |
Marking shortest paths on pushdown graphs does not preserve MSO decidability
Information Processing Letters | 2016-07-07 | Paper |
Regular strategies in pushdown reachability games
Lecture Notes in Computer Science | 2015-10-28 | Paper |
Randomization in automata on infinite trees
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
C-SHORe: a collapsible approach to higher-order verification
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming | 2015-03-30 | Paper |
| On the representation of McCarthy's amb in the \(\pi\)-calculus | 2013-09-09 | Paper |
The FC-rank of a context-free language
Information Processing Letters | 2013-06-28 | Paper |
A Saturation Method for Collapsible Pushdown Systems
Automata, Languages, and Programming | 2012-11-01 | Paper |
Algebraic synchronization trees and processes
Automata, Languages, and Programming | 2012-11-01 | Paper |
A context-free linear ordering with an undecidable first-order theory
Lecture Notes in Computer Science | 2012-09-21 | Paper |
| Distribution of the number of accessible states in a random deterministic automaton | 2012-08-23 | Paper |
Choice functions and well-orderings over the infinite binary tree
Central European Journal of Mathematics | 2010-11-22 | Paper |
Linear Orders in the Pushdown Hierarchy
Automata, Languages and Programming | 2010-09-07 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
On Rational Trees
Computer Science Logic | 2009-03-12 | Paper |
MSO on the Infinite Binary Tree: Choice and Order
Computer Science Logic | 2009-03-05 | Paper |
Positional Strategies for Higher-Order Pushdown Parity Games
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Context-Sensitive Languages, Rational Graphs and Determinism
Logical Methods in Computer Science | 2007-10-11 | Paper |
The Kleene Equality for Graphs
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Linearly bounded infinite graphs
Acta Informatica | 2006-11-27 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
Theoretical Computer Science | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 2038741 (Why is no real title available?) | 2004-02-08 | Paper |
