| Publication | Date of Publication | Type |
|---|
Elements of Discrete Mathematics
| 2023-11-07 | Paper |
Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Reachability games and parity games
Lecture Notes in Computer Science | 2023-07-28 | Paper |
Conelikes and ranker comparisons
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words
| 2022-03-25 | Paper |
Testing Simon's congruence
| 2021-08-04 | Paper |
The intersection problem for finite monoids
| 2020-08-05 | Paper |
Nilpotency and strong nilpotency for finite semigroups
The Quarterly Journal of Mathematics | 2019-07-29 | Paper |
The complexity of weakly recognizing morphisms
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Green's relations in deterministic finite automata
Theory of Computing Systems | 2019-07-04 | Paper |
Regular languages are Church-Rosser congruential
Journal of the ACM | 2018-08-02 | Paper |
Level two of the quantifier alternation hierarchy over infinite words
Theory of Computing Systems | 2018-06-01 | Paper |
The word problem for omega-terms over the Trotter-Weil hierarchy
Theory of Computing Systems | 2018-06-01 | Paper |
Solutions of word equations over partially commutative structures
| 2017-12-19 | Paper |
The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
Theory of Computing Systems | 2017-10-20 | Paper |
Green's relations in finite transformation semigroups
| 2017-08-22 | Paper |
Efficient algorithms for morphisms over omega-regular languages
| 2017-07-13 | Paper |
Ehrenfeucht-Fraïssé games on omega-terms
| 2017-03-03 | Paper |
Quantifier alternation in two-variable first-order logic with successor is decidable
| 2017-01-30 | Paper |
Operations on weakly recognizing morphisms
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
Around dot-depth one
| 2016-07-26 | Paper |
Level Two of the Quantifier Alternation Hierarchy over Infinite Words
Computer Science – Theory and Applications | 2016-07-25 | Paper |
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Discrete algebraic methods. Arithmetic, cryptography, automata and groups
De Gruyter Textbook | 2016-04-05 | Paper |
A survey on the local divisor technique
Theoretical Computer Science | 2015-12-10 | Paper |
Omega-rational expressions with bounded synchronization delay
Theory of Computing Systems | 2015-07-20 | Paper |
One quantifier alternation in first-order logic with modular predicates
RAIRO - Theoretical Informatics and Applications | 2015-04-15 | Paper |
On the index of Simon's congruence for piecewise testability
Information Processing Letters | 2015-01-30 | Paper |
Star-free languages and local divisors
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Block products and nesting negations in \(\mathrm{FO}^{2}\)
Computer Science - Theory and Applications | 2014-06-24 | Paper |
The join of the varieties of \(R\)-trivial and \(L\)-trivial monoids via combinatorics on words
| 2014-03-25 | Paper |
Elements of discrete mathematics. Numbers and counting, graphs and lattices
De Gruyter Studium | 2013-07-23 | Paper |
Discrete algebraic methods. Arithmetic, cryptography, automata and groups
De Gruyter Studium | 2013-07-23 | Paper |
Around dot-depth one
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
The \(\mathrm{FO}^2\) alternation hierarchy is decidable
| 2012-11-22 | Paper |
Lattices of logical fragments over words (extended abstract)
Automata, Languages, and Programming | 2012-11-01 | Paper |
Regular languages are Church-Rosser congruential
Automata, Languages, and Programming | 2012-11-01 | Paper |
Star-free languages are Church-Rosser congruential
Theoretical Computer Science | 2012-10-11 | Paper |
The Join Levels of the Trotter-Weil Hierarchy Are Decidable
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Regular ideal languages and their Boolean combinations
Implementation and Application of Automata | 2012-09-20 | Paper |
Bounded synchronization delay in omega-rational expressions
Computer Science – Theory and Applications | 2012-09-10 | Paper |
On logical hierarchies within \(\mathrm{FO}^{2}\)-definable languages
Logical Methods in Computer Science | 2012-08-15 | Paper |
The Krohn-Rhodes theorem and local divisors
Fundamenta Informaticae | 2012-06-20 | Paper |
On smoothed analysis of quicksort and Hoare's find
Algorithmica | 2012-04-26 | Paper |
Fragments of first-order logic over infinite words
| 2012-04-24 | Paper |
Partially ordered two-way Büchi automata
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
First-order fragments with successor over infinite words
| 2012-01-23 | Paper |
Fragments of first-order logic over infinite words
Theory of Computing Systems | 2011-05-23 | Paper |
Partially ordered two-way Büchi automata
Implementation and Application of Automata | 2011-02-11 | Paper |
On the lattice of sub-pseudovarieties of DA.
Semigroup Forum | 2010-10-27 | Paper |
Rankers over infinite words (extended abstract)
Developments in Language Theory | 2010-08-31 | Paper |
On FO 2 Quantifier Alternation over Words
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
On Smoothed Analysis of Quicksort and Hoare’s Find
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
Developments in Language Theory | 2009-03-26 | Paper |
The Height of Factorization Forests
Lecture Notes in Computer Science | 2009-02-03 | Paper |
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
International Journal of Foundations of Computer Science | 2008-11-24 | Paper |
scientific article; zbMATH DE number 5286857 (Why is no real title available?)
| 2008-06-11 | Paper |
scientific article; zbMATH DE number 5222362 (Why is no real title available?)
| 2008-01-02 | Paper |
On First-Order Fragments for Words and Mazurkiewicz Traces
Developments in Language Theory | 2007-11-28 | Paper |
Polynomials, fragments of temporal logic and the variety DA over traces
Theoretical Computer Science | 2007-05-11 | Paper |
scientific article; zbMATH DE number 1948486 (Why is no real title available?)
| 2003-07-13 | Paper |
