| Publication | Date of Publication | Type |
|---|
Reachability in trace-pushdown systems
Theoretical Computer Science | 2026-06-15 | Paper |
| Disjointness, inclusion, and regularity of -rational trace languages (extended abstract) | 2026-02-26 | Paper |
| The theory of reachability of trace-pushdown systems | 2025-11-19 | Paper |
| Modal logic is more succinct iff bi-implication is available in some form | 2025-11-10 | Paper |
Boolean basis, formula size, and number of modal operators
Logical Methods in Computer Science | 2025-09-25 | Paper |
| A class of rational trace relations closed under composition | 2025-07-28 | Paper |
Backwards-reachability for cooperating multi-pushdown systems
Journal of Computer and System Sciences | 2024-12-27 | Paper |
| Languages and logical definability in concurrency monoids | 2024-06-21 | Paper |
| Forwards- and backwards-reachability for cooperating multi-pushdown systems | 2024-05-29 | Paper |
On Presburger arithmetic extended with non-unary counting quantifiers
Logical Methods in Computer Science | 2023-08-26 | Paper |
Alternating complexity of counting first-order logic for the subword order
Acta Informatica | 2023-03-01 | Paper |
The subtrace order and counting first-order logic
Computer Science – Theory and Applications | 2022-10-19 | Paper |
| Complexity of counting first-order logic for the subword order | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7533328 (Why is no real title available?) | 2022-05-28 | Paper |
Traces, series-parallel posets, and pictures: a weighted study
Monographs in Theoretical Computer Science | 2022-04-28 | Paper |
| Second-order finite automata: expressive power and simple proofs using automatic structures | 2022-03-25 | Paper |
| Weighted automata | 2022-02-04 | Paper |
| Multi-buffer simulations for trace language inclusion | 2021-12-07 | Paper |
Multi-buffer simulations for trace language inclusion
(available as arXiv preprint) | 2021-12-07 | Paper |
| Communicating automata | 2021-11-12 | Paper |
| Gaifman normal forms for counting extensions of first-order logic | 2021-07-28 | Paper |
| First-order logic with counting: at least, \textit{weak} Hanf normal forms always exist and can be computed! | 2021-01-19 | Paper |
First-order logic with counting: at least, \textit{weak} Hanf normal forms always exist and can be computed!
(available as arXiv preprint) | 2021-01-19 | Paper |
Languages ordered by the subword order
(available as arXiv preprint) | 2020-01-28 | Paper |
The inclusion structure of partially lossy queue monoids and their trace submonoids
RAIRO - Theoretical Informatics and Applications | 2018-11-01 | Paper |
Multi-buffer simulations: decidability and complexity
Information and Computation | 2018-09-27 | Paper |
Infinite and bi-infinite words with decidable monadic theories
(available as arXiv preprint) | 2018-09-06 | Paper |
Hanf normal form for first-order logic with unary counting quantifiers
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
The monoid of queue actions
Semigroup Forum | 2018-02-28 | Paper |
Dependence orders for computations of concurrent automata
STACS 95 | 2017-12-04 | Paper |
| Infinite and bi-infinite words with decidable monadic theories | 2017-08-31 | Paper |
| The transformation monoid of a partially lossy queue | 2017-08-22 | Paper |
The complexity of model checking multi-stack systems
Theory of Computing Systems | 2017-08-15 | Paper |
On Boolean closed full trios and rational Kripke frames
Theory of Computing Systems | 2017-07-17 | Paper |
The Complexity of Model Checking Multi-stack Systems
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
The trace monoids in the queue monoid and in the direct product of two free monoids
Developments in Language Theory | 2016-08-30 | Paper |
On Presburger arithmetic extended with modulo counting quantifiers
Lecture Notes in Computer Science | 2015-10-01 | Paper |
Almost every domain is universal
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
Recognizable and logically definable languages of infinite computations in concurrent automata
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
The Monoid of Queue Actions
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Isomorphisms of scattered automatic linear orders
Theoretical Computer Science | 2014-04-16 | Paper |
Isomorphisms of scattered automatic linear orders
Theoretical Computer Science | 2014-04-16 | Paper |
On the automaticity of singular Artin monoids of finite type.
International Journal of Computer Mathematics | 2013-10-22 | Paper |
Logical aspects of the lexicographic order on 1-counter languages
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
The isomorphism problem on classes of automatic structures with transitive relations
Transactions of the American Mathematical Society | 2013-09-04 | Paper |
| Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic | 2013-03-19 | Paper |
| Isomorphisms of scattered automatic linear orders | 2012-11-22 | Paper |
The isomorphism problem for \(\omega \)-automatic trees
Annals of Pure and Applied Logic | 2012-11-20 | Paper |
An optimal construction of Hanf sentences
Journal of Applied Logic | 2012-05-23 | Paper |
| (Un)countable and (non)effective versions of Ramsey's theorem | 2012-03-02 | Paper |
| Is Ramsey's theorem omega-automatic? | 2012-01-23 | Paper |
Automatic structures of bounded degree revisited
Journal of Symbolic Logic | 2011-12-23 | Paper |
Where automatic structures benefit from weighted automata
Algebraic Foundations in Computer Science | 2011-11-11 | Paper |
Construction of tree automata from regular expressions
RAIRO - Theoretical Informatics and Applications | 2011-10-28 | Paper |
Construction of tree automata from regular expressions
RAIRO - Theoretical Informatics and Applications | 2011-10-28 | Paper |
Size and computation of injective tree automatic presentations
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
| scientific article; zbMATH DE number 5854944 (Why is no real title available?) | 2011-02-22 | Paper |
Propositional dynamic logic for message-passing systems
Logical Methods in Computer Science | 2010-09-21 | Paper |
The isomorphism problem for \(\omega \)-automatic trees
Computer Science Logic | 2010-09-03 | Paper |
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
Information and Computation | 2010-08-18 | Paper |
Some natural decision problems in automatic graphs
Journal of Symbolic Logic | 2010-06-24 | Paper |
Branching automata with costs -- a way of reflecting parallelism in costs
Implementation and Application of Automata | 2010-05-07 | Paper |
Satisfiability and model checking for MSO-definable temporal logics are in PSPACE.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
| Is Cantor's theorem automatic? | 2010-02-24 | Paper |
Automatic Structures of Bounded Degree Revisited
Computer Science Logic | 2009-11-12 | Paper |
Theories of Automatic Structures and Their Complexity
Algebraic Informatics | 2009-11-05 | Paper |
Weighted asynchronous cellular automata
Theoretical Computer Science | 2009-06-22 | Paper |
Construction of Tree Automata from Regular Expressions
Developments in Language Theory | 2008-10-30 | Paper |
Muller message-passing automata and logics
Information and Computation | 2008-10-08 | Paper |
Schützenberger's theorem on formal power series follows from Kleene's theorem
Theoretical Computer Science | 2008-07-31 | Paper |
| scientific article; zbMATH DE number 5286865 (Why is no real title available?) | 2008-06-11 | Paper |
| scientific article; zbMATH DE number 5286864 (Why is no real title available?) | 2008-06-11 | Paper |
First-order and counting theories of<i>ω</i>-automatic structures
Journal of Symbolic Logic | 2008-05-08 | Paper |
Propositional Dynamic Logic for Message-Passing Systems
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Weighted Asynchronous Cellular Automata
STACS 2006 | 2008-03-19 | Paper |
| On communicating automata with bounded channels | 2008-01-02 | Paper |
| Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces | 2008-01-02 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Skew and infinitary formal power series
Theoretical Computer Science | 2007-01-09 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
On graph products of automatic and biautomatic monoids.
Semigroup Forum | 2006-09-12 | Paper |
| Trace languages definable with modular quantifiers | 2006-09-06 | Paper |
LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
International Journal of Algebra and Computation | 2006-08-14 | Paper |
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation | 2006-07-12 | Paper |
Theories of orders on the set of words
RAIRO - Theoretical Informatics and Applications | 2006-02-22 | Paper |
Theories of orders on the set of words
RAIRO - Theoretical Informatics and Applications | 2006-02-22 | Paper |
Theories of orders on the set of words
RAIRO - Theoretical Informatics and Applications | 2006-02-22 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Distributive lattices with a decidable monadic second order theory.
Algebra Universalis | 2005-04-19 | Paper |
Decidable first-order theories of one-step rewriting in trace monoids
Theory of Computing Systems | 2005-02-24 | Paper |
Logical aspects of Cayley-graphs: the group case
Annals of Pure and Applied Logic | 2005-01-31 | Paper |
Branching automata with costs -- a way of reflecting parallelism in costs
Theoretical Computer Science | 2005-01-11 | Paper |
Regular sets of infinite message sequence charts
Information and Computation | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2087224 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086410 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086668 (Why is no real title available?) | 2004-08-11 | Paper |
The topology of Mazurkiewicz traces.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2038728 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1962836 (Why is no real title available?) | 2003-08-11 | Paper |
On random relational structures
Journal of Combinatorial Theory. Series A | 2003-07-01 | Paper |
| scientific article; zbMATH DE number 1916672 (Why is no real title available?) | 2003-05-26 | Paper |
Towards a language theory for infinite N-free pomsets.
Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1839447 (Why is no real title available?) | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1759627 (Why is no real title available?) | 2002-11-28 | Paper |
| scientific article; zbMATH DE number 1759634 (Why is no real title available?) | 2002-11-28 | Paper |
| scientific article; zbMATH DE number 1696781 (Why is no real title available?) | 2002-07-22 | Paper |
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science | 2002-06-05 | Paper |
| scientific article; zbMATH DE number 1688382 (Why is no real title available?) | 2002-01-09 | Paper |
Complementary closed relational clones are not always Krasner clones
Algebra Universalis | 2001-12-16 | Paper |
| scientific article; zbMATH DE number 1670860 (Why is no real title available?) | 2001-11-11 | Paper |
Generic automorphisms of the universal partial order
Proceedings of the American Mathematical Society | 2001-05-14 | Paper |
On Existentially First-Order Definable Languages and Their Relation to NP
RAIRO - Theoretical Informatics and Applications | 2000-12-06 | Paper |
On Existentially First-Order Definable Languages and Their Relation to NP
RAIRO - Theoretical Informatics and Applications | 2000-12-06 | Paper |
Asynchronous cellular automata for pomsets
Theoretical Computer Science | 2000-10-26 | Paper |
| scientific article; zbMATH DE number 1305000 (Why is no real title available?) | 2000-10-17 | Paper |
On homogeneous semilattices and their automorphism groups
Order | 2000-10-08 | Paper |
Symmetries of the partial order of traces
Order | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1456962 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1390068 (Why is no real title available?) | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1261672 (Why is no real title available?) | 1999-03-15 | Paper |
Representation of computations in concurrent automata by dependence orders
Theoretical Computer Science | 1998-10-22 | Paper |
Topology for Computations of Concurrent Automata
International Journal of Algebra and Computation | 1997-09-15 | Paper |
| scientific article; zbMATH DE number 849039 (Why is no real title available?) | 1996-02-28 | Paper |
