| Publication | Date of Publication | Type |
|---|
An algorithmic approach for checking closure properties of Ω-regular languages
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
Translating regular expressions into small -free nondeterministic finite automata
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time
TAPSOFT '95: Theory and Practice of Software Development | 2022-08-18 | Paper |
| -automata | 2022-02-04 | Paper |
| Profile trees for Büchi word automata, with application to determinization | 2021-06-09 | Paper |
| Backward Deterministic Büchi Automata on Infinite Words | 2020-11-25 | Paper |
Algebras for classifying regular tree languages and an application to frontier testability
Automata, Languages and Programming | 2019-03-29 | Paper |
Star-free picture expressions are strictly weaker than first-order logic
Automata, Languages and Programming | 2018-07-04 | Paper |
Bounds for approximating MaxLinEq3-2 and MaxEkSat
Lectures on Proof Verification and Approximation Algorithms | 2018-07-03 | Paper |
| Past, present, and infinite future | 2017-12-19 | Paper |
Stutter-invariant temporal properties are expressible without the next-time operator
Information Processing Letters | 2016-06-01 | Paper |
Profile trees for Büchi word automata, with application to determinization
Information and Computation | 2015-12-07 | Paper |
Deciding strategy properties of contract-signing protocols
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
A play on regular expressions: functional pearl
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming | 2015-03-05 | Paper |
Noninterference with Local Policies
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Effective characterizations of simple fragments of temporal logic using Carton-Michel automata
Logical Methods in Computer Science | 2013-06-24 | Paper |
Unifying Büchi complementation constructions
Logical Methods in Computer Science | 2013-04-09 | Paper |
Unifying Büchi complementation constructions
(available as arXiv preprint) | 2012-09-18 | Paper |
| Unifying Büchi complementation constructions | 2012-09-18 | Paper |
Effective characterizations of simple fragments of temporal logic using prophetic automata
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
| Modern cryptography. An introduction. | 2011-08-26 | Paper |
| scientific article; zbMATH DE number 5872401 (Why is no real title available?) | 2011-03-30 | Paper |
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol
Computer Security – ESORICS 2009 | 2009-10-16 | Paper |
Simulation Relations for Alternating Parity Automata and Parity Games
Developments in Language Theory | 2009-03-26 | Paper |
A characterization of first-order topological properties of planar spatial data
Journal of the ACM | 2008-12-21 | Paper |
Complementation, Disambiguation, and Determinization of Büchi Automata Unified
Automata, Languages and Programming | 2008-08-28 | Paper |
Transducer-based analysis of cryptographic protocols
Information and Computation | 2007-12-10 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
A Dolev-Yao-Based Definition of Abuse-Free Protocols
Automata, Languages and Programming | 2007-09-11 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
First-order logic with two variables and unary temporal logic
Information and Computation | 2006-10-10 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
SIAM Journal on Computing | 2005-09-16 | Paper |
Simulation relations for alternating Büchi automata
Theoretical Computer Science | 2005-06-30 | Paper |
Nesting until and since in linear temporal logic
Theory of Computing Systems | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2086407 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1954381 (Why is no real title available?) | 2003-07-28 | Paper |
| scientific article; zbMATH DE number 1954388 (Why is no real title available?) | 2003-07-28 | Paper |
| scientific article; zbMATH DE number 1848280 (Why is no real title available?) | 2003-02-25 | Paper |
An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1775408 (Why is no real title available?) | 2002-09-17 | Paper |
Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
Journal of Computer and System Sciences | 2002-07-02 | Paper |
| scientific article; zbMATH DE number 1754630 (Why is no real title available?) | 2002-06-12 | Paper |
Temporal logic and semidirect products: An effective characterization of the until hierarchy
SIAM Journal on Computing | 2002-04-23 | Paper |
Mesoscopic QCD and the -vacua
Nuclear Physics B | 2002-02-13 | Paper |
Alternating tree automata, parity games, and modal -calculus
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2002-01-14 | Paper |
Spectral ergodicity and normal modes in ensembles of sparse matrices
Nuclear Physics. A | 2001-06-07 | Paper |
Nonlinear -model for gauge field disorder
Nuclear Physics B | 2000-12-05 | Paper |
| scientific article; zbMATH DE number 1500644 (Why is no real title available?) | 2000-11-07 | Paper |
| scientific article; zbMATH DE number 1405651 (Why is no real title available?) | 2000-04-25 | Paper |
| scientific article; zbMATH DE number 1304310 (Why is no real title available?) | 1999-06-17 | Paper |
An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages
Theoretical Computer Science | 1999-03-30 | Paper |
Computing the rabin index of a regular language of infinite words
Information and Computation | 1997-10-13 | Paper |
An algebraic characterization of frontier testable tree languages
Theoretical Computer Science | 1997-02-28 | Paper |
Confinement in the Coulomb gauge model.
Annals of Physics | 1997-01-01 | Paper |
AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
International Journal of Algebra and Computation | 1994-03-24 | Paper |
| scientific article; zbMATH DE number 512866 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 176766 (Why is no real title available?) | 1993-05-18 | Paper |
