| Publication | Date of Publication | Type |
|---|
| Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests | 2024-12-19 | Paper |
| The complexity of bidirected reachability in valence systems | 2024-12-06 | Paper |
| Ramsey quantifiers over automatic structures: complexity and applications to verification | 2024-12-06 | Paper |
| Context-bounded analysis of concurrent programs (invited talk) | 2024-11-14 | Paper |
| Checking refinement of asynchronous programs against context-free specifications | 2024-11-14 | Paper |
| Regular separability in Büchi VASS | 2024-10-08 | Paper |
| Membership problems in finite groups | 2024-08-06 | Paper |
| Reachability in bidirected pushdown VASS | 2024-06-24 | Paper |
| Existential definability over the subword ordering | 2024-04-23 | Paper |
Existential Definability over the Subword Ordering
Logical Methods in Computer Science | 2024-01-16 | Paper |
Unboundedness problems for machines with reversal-bounded counters
Lecture Notes in Computer Science | 2023-11-24 | Paper |
Knapsack and the power word problem in solvable Baumslag–Solitar groups
International Journal of Algebra and Computation | 2023-06-01 | Paper |
| Recent advances on reachability problems for valence systems (invited talk) | 2023-03-31 | Paper |
Regular Separability and Intersection Emptiness Are Independent Problems
(available as arXiv preprint) | 2023-02-03 | Paper |
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
Logical Methods in Computer Science | 2023-01-09 | Paper |
scientific article; zbMATH DE number 7559438 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Membership Problems in Finite Groups | 2022-06-23 | Paper |
Closure properties of knapsack semilinear groups
Journal of Algebra | 2021-10-22 | Paper |
General decidability results for asynchronous shared-memory programs: higher-order and beyond
(available as arXiv preprint) | 2021-08-04 | Paper |
Bounded context switching for valence systems
(available as arXiv preprint) | 2021-08-04 | Paper |
Unboundedness problems for languages of vector addition systems
(available as arXiv preprint) | 2021-07-28 | Paper |
The emptiness problem for valence automata over graph monoids
Information and Computation | 2021-04-13 | Paper |
Extensions of \(\omega \)-regular languages
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
An Approach to Regular Separability in Vector Addition Systems
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Separability by piecewise testable languages and downward closures beyond subwords
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| scientific article; zbMATH DE number 7297889 (Why is no real title available?) | 2021-01-19 | Paper |
scientific article; zbMATH DE number 7297889 (Why is no real title available?)
(available as arXiv preprint) | 2021-01-19 | Paper |
| A characterization of wreath products where knapsack is decidable | 2021-01-15 | Paper |
Knapsack problems for wreath products
(available as arXiv preprint) | 2020-08-05 | Paper |
| Rational subsets of Baumslag-Solitar groups | 2020-06-21 | Paper |
| The complexity of knapsack problems in wreath products | 2020-02-19 | Paper |
Knapsack and the power word problem in solvable Baumslag-Solitar groups
(available as arXiv preprint) | 2020-02-07 | Paper |
Languages ordered by the subword order
(available as arXiv preprint) | 2020-01-28 | Paper |
Closure properties of knapsack semilinear groups
(available as arXiv preprint) | 2019-11-28 | Paper |
Coverability Is undecidable in one-dimensional pushdown vector addition systems with resets
(available as arXiv preprint) | 2019-10-22 | Paper |
| Monoids as storage mechanisms | 2019-07-03 | Paper |
A characterization for decidable separability by piecewise testable languages
(available as arXiv preprint) | 2018-12-10 | Paper |
| A characterization for decidable separability by piecewise testable languages | 2018-12-10 | Paper |
The complexity of regular abstractions of one-counter languages
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
First-order logic with reachability for infinite-state systems
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
The Complexity of Knapsack in Graph Groups
(available as arXiv preprint) | 2018-04-19 | Paper |
Knapsack in graph groups
Theory of Computing Systems | 2018-03-01 | Paper |
The monoid of queue actions
Semigroup Forum | 2018-02-28 | Paper |
Knapsack in graph groups, HNN-extensions and amalgamated products
(available as arXiv preprint) | 2018-01-24 | Paper |
The complexity of downward closure comparisons
(available as arXiv preprint) | 2017-12-19 | Paper |
| The emptiness problem for valence automata or: another decidable extension of Petri nets | 2017-10-27 | Paper |
On Boolean closed full trios and rational Kripke frames
Theory of Computing Systems | 2017-07-17 | Paper |
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
Algebra and Computer Science | 2017-04-11 | Paper |
| On Boolean closed full trios and rational Kripke frames | 2017-03-03 | Paper |
Computing downward closures for stacked counter automata
(available as arXiv preprint) | 2017-01-24 | Paper |
Permutations of context-free, ET0L and indexed languages
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2016-08-23 | Paper |
Permutations of context-free, ET0L and indexed languages
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2016-08-23 | Paper |
An approach to computing downward closures
Automata, Languages, and Programming | 2015-11-04 | Paper |
Rational subsets and submonoids of wreath products.
Information and Computation | 2015-06-09 | Paper |
The Monoid of Queue Actions
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Silent transitions in automata with storage
Automata, Languages, and Programming | 2013-08-07 | Paper |
Rational subsets and submonoids of wreath products.
Lecture Notes in Computer Science | 2013-08-07 | Paper |
CONCURRENT FINITE AUTOMATA AND RELATED LANGUAGE CLASSES (AN OVERVIEW)
Automata, Formal Languages and Algebraic Systems | 2013-06-03 | Paper |
A sufficient condition for erasing productions to be avoidable
Developments in Language Theory | 2011-07-29 | Paper |
On the capabilities of grammars, automata, and transducers controlled by monoids
Automata, Languages and Programming | 2011-07-07 | Paper |
TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
On erasing productions in random context grammars
Automata, Languages and Programming | 2010-09-07 | Paper |
| scientific article; zbMATH DE number 5593273 (Why is no real title available?) | 2009-08-10 | Paper |
| scientific article; zbMATH DE number 5593274 (Why is no real title available?) | 2009-08-10 | Paper |
Erasing in Petri Net Languages and Matrix Grammars
Developments in Language Theory | 2009-07-07 | Paper |
| Petri net controlled finite automata | 2009-01-28 | Paper |
| scientific article; zbMATH DE number 5499356 (Why is no real title available?) | 2009-01-28 | Paper |
Labeled Step Sequences in Petri Nets
Applications and Theory of Petri Nets | 2008-07-03 | Paper |
An efficient quantifier elimination procedure for Presburger arithmetic
(available as arXiv preprint) | N/A | Paper |
