| Publication | Date of Publication | Type |
|---|
| Group separation strikes back | 2026-02-27 | Paper |
| A generic characterization of generalized unary temporal logic and two-variable first-order logic | 2026-02-19 | Paper |
| In orbit with MeSCaL: higher in concatenation and navigational hierarchies of regular languages | 2026-02-10 | Paper |
| A first taste of MeSCaL, a tool for solving membership problems for regular languages | 2026-02-10 | Paper |
| Separation and covering for group based concatenation hierarchies | 2024-12-19 | Paper |
| A generic polynomial time approach to separation by first-order logic without quantifier alternation | 2024-09-12 | Paper |
All about unambiguous polynomial closure
TheoretiCS | 2024-07-03 | Paper |
How many times do you need to go back to the future in unary temporal logic?
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Characterizing level one in group-based concatenation hierarchies
(available as arXiv preprint) | 2022-11-11 | Paper |
Recognizing pro-\(\mathrm{R}\) closures of regular languages
Forum Mathematicum | 2022-09-12 | Paper |
The Complexity of Separation for Levels in Concatenation Hierarchies
(available as arXiv preprint) | 2022-07-21 | Paper |
On All Things Star-Free
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7407796 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407796 (Why is no real title available?) | 2021-10-08 | Paper |
| Separating Without Any Ambiguity. | 2021-07-28 | Paper |
| Separation for dot-depth two | 2021-01-19 | Paper |
Adding Successor
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Going Higher in First-Order Quantifier Alternation Hierarchies on Words
Journal of the ACM | 2019-11-21 | Paper |
The linear nature of pseudowords
Publicacions Matemàtiques | 2019-08-15 | Paper |
The linear nature of pseudowords
Publicacions Matemàtiques | 2019-08-15 | Paper |
Generic results for concatenation hierarchies
Theory of Computing Systems | 2019-07-04 | Paper |
Recognizing pro-R closures of regular languages
(available as arXiv preprint) | 2019-05-24 | 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 covering problem
(available as arXiv preprint) | 2018-08-15 | Paper |
Separating regular languages with first-order logic
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Logical characterization of weighted pebble walking automata
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
| scientific article; zbMATH DE number 6851910 (Why is no real title available?) | 2018-03-21 | Paper |
| Concatenation hierarchies: new bottle, old wine | 2017-08-22 | Paper |
Reducibility of pointlike problems
Semigroup Forum | 2017-07-14 | Paper |
Factoriality and the Pin-Reutenauer procedure
(available as arXiv preprint) | 2017-03-03 | Paper |
| Factoriality and the Pin-Reutenauer procedure | 2017-03-03 | Paper |
The linear nature of pseudowords
(available as arXiv preprint) | 2017-02-26 | Paper |
| Separating regular languages by locally testable and locally threshold testable languages | 2017-02-21 | Paper |
| Separation and the successor relation | 2017-01-24 | Paper |
Quantifier alternation for infinite words
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Separating regular languages with first-order logic
Logical Methods in Computer Science | 2016-03-11 | Paper |
A Note on Decidable Separability by Piecewise Testable Languages
Fundamentals of Computation Theory | 2015-09-29 | Paper |
McCammond’s normal forms for free aperiodic semigroups revisited
LMS Journal of Computation and Mathematics | 2015-01-27 | Paper |
Temporal logics for concurrent recursive programs: satisfiability and model checking
Journal of Applied Logic | 2014-11-20 | Paper |
Closures of regular languages for profinite topologies.
Semigroup Forum | 2014-11-03 | Paper |
On separation by locally testable and locally threshold testable languages
Logical Methods in Computer Science | 2014-09-30 | Paper |
Pebble weighted automata and weighted logics
ACM Transactions on Computational Logic | 2014-07-17 | Paper |
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
Automata, Languages, and Programming | 2014-07-01 | Paper |
Iterated periodicity over finite aperiodic semigroups
European Journal of Combinatorics | 2014-02-07 | Paper |
Separating regular languages by piecewise testable and unambiguous languages
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| Scenarios and covert channels: another game\dots | 2013-09-20 | Paper |
A probabilistic Kleene theorem
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
| Place-boundedness for vector addition systems with one zero-test | 2012-08-29 | Paper |
Model checking vector addition systems with one zero-test
Logical Methods in Computer Science | 2012-07-03 | Paper |
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Pebble weighted automata and transitive closure logics
Automata, Languages and Programming | 2010-09-07 | Paper |
Description and analysis of a bottom-up DFA minimization algorithm
Information Processing Letters | 2010-04-19 | Paper |
THE EQUATIONAL THEORY OF ω-TERMS FOR FINITE ${\mathcal R}$-TRIVIAL SEMIGROUPS
Semigroups and Languages | 2010-04-14 | Paper |
Distributed synthesis for well-connected architectures
Formal Methods in System Design | 2009-09-25 | Paper |
| scientific article; zbMATH DE number 5587278 (Why is no real title available?) | 2009-07-27 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Tree Pattern Rewriting Systems
Automated Technology for Verification and Analysis | 2008-11-20 | Paper |
Distributed Synthesis for Well-Connected Architectures
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Accelerating Interpolation-Based Model-Checking
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
Complete reducibility of systems of equations with respect to \(\mathbf R\).
Portugaliae Mathematica. Nova Série | 2008-04-03 | Paper |
Pointlike sets with respect to R and J.
Journal of Pure and Applied Algebra | 2007-12-06 | Paper |
| Complete reducibility of pseudovarieties. | 2007-12-05 | Paper |
Model Checking Software
Lecture Notes in Computer Science | 2007-09-28 | Paper |
An automata-theoretic approach to the word problem for \(\omega\)-terms over R
Theoretical Computer Science | 2007-02-26 | Paper |
Infinite-state high-level MSCs: model-checking and realizability
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Tameness of pseudovariety joins involving R.
Monatshefte für Mathematik | 2006-02-07 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
| scientific article; zbMATH DE number 2086660 (Why is no real title available?) | 2004-08-11 | Paper |
Tameness of Some Locally Trivial Pseudovarieties
Communications in Algebra | 2003-04-02 | Paper |
scientific article; zbMATH DE number 1652000 (Why is no real title available?)
SCOPOS | 2001-09-27 | Paper |
PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
International Journal of Algebra and Computation | 2000-11-07 | Paper |
The pseudovariety $J$ is hyperdecidable
RAIRO - Theoretical Informatics and Applications | 1999-09-12 | Paper |
| scientific article; zbMATH DE number 1254111 (Why is no real title available?) | 1999-02-23 | Paper |
Three examples of join computations
Semigroup Forum | 1999-01-27 | Paper |
On embedding of finitely generated profinite semigroups into \(2\)-generated profinite semigroups
Algebra Universalis | 1998-11-23 | Paper |
The join of the pseudovarieties of idempotent semigroups and locally trivial semigroups
Semigroup Forum | 1996-07-01 | Paper |
Corrigendum: ``The join of the pseudovarieties of idempotent semigroups and locally trivial semigroups
Semigroup Forum | 1996-04-23 | Paper |
ON THE DECIDABILITY OF THE MEMBERSHIP PROBLEM OF THE PSEUDOVARIETY J∨B
International Journal of Algebra and Computation | 1996-02-22 | Paper |
