Latest revision as of 05:44, 9 December 2023
Available identifiers
zbMath Open wilke.thomasMaRDI QIDQ208756
List of research outcomes
Publication | Date of Publication | Type |
---|
An algorithmic approach for checking closure properties of Ω-regular languages | 2023-06-28 | Paper |
Translating regular expressions into small ε-free nondeterministic finite automata | 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 | 2022-08-18 | Paper |
\( \omega \)-automata | 2022-02-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4992510 | 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 | 2019-03-29 | Paper |
Star-free picture expressions are strictly weaker than first-order logic | 2018-07-04 | Paper |
Bounds for approximating MaxLinEq3-2 and MaxEkSat | 2018-07-03 | Paper |
Past, Present, and Infinite Future | 2017-12-19 | Paper |
Stutter-invariant temporal properties are expressible without the next-time operator | 2016-06-01 | Paper |
Profile trees for Büchi word automata, with application to determinization | 2015-12-07 | Paper |
Deciding strategy properties of contract-signing protocols | 2015-09-17 | Paper |
A play on regular expressions | 2015-03-05 | Paper |
Noninterference with Local Policies | 2013-09-20 | Paper |
Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata | 2013-06-24 | Paper |
Unifying B\"uchi Complementation Constructions | 2013-04-09 | Paper |
Unifying Büchi Complementation Constructions. | 2012-09-18 | Paper |
Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata | 2012-06-22 | Paper |
Moderne Kryptographie | 2011-08-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3086936 | 2011-03-30 | Paper |
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol | 2009-10-16 | Paper |
Simulation Relations for Alternating Parity Automata and Parity Games | 2009-03-26 | Paper |
A characterization of first-order topological properties of planar spatial data | 2008-12-21 | Paper |
Complementation, Disambiguation, and Determinization of Büchi Automata Unified | 2008-08-28 | Paper |
Transducer-based analysis of cryptographic protocols | 2007-12-10 | Paper |
STACS 2004 | 2007-10-01 | Paper |
A Dolev-Yao-Based Definition of Abuse-Free Protocols | 2007-09-11 | Paper |
Computer Science Logic | 2007-06-21 | Paper |
CONCUR 2005 – Concurrency Theory | 2006-11-01 | Paper |
First-order logic with two variables and unary temporal logic | 2006-10-10 | Paper |
STACS 2005 | 2005-12-02 | Paper |
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata | 2005-09-16 | Paper |
Simulation relations for alternating Büchi automata | 2005-06-30 | Paper |
Nesting until and since in linear temporal logic | 2005-01-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4736862 | 2004-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4415252 | 2003-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4415259 | 2003-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4785458 | 2003-02-25 | Paper |
An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic | 2003-01-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4542541 | 2002-09-17 | Paper |
Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata | 2002-07-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4535058 | 2002-06-12 | Paper |
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy | 2002-04-23 | Paper |
Mesoscopic QCD and the \(\theta\)-vacua | 2002-02-13 | Paper |
Alternating tree automata, parity games, and modal \(\mu\)-calculus | 2002-01-14 | Paper |
Nonlinear \(\sigma\)-model for gauge field disorder | 2000-12-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q4501666 | 2000-11-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4938632 | 2000-04-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4251040 | 1999-06-17 | Paper |
An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages | 1999-03-30 | Paper |
Computing the rabin index of a regular language of infinite words | 1997-10-13 | Paper |
An algebraic characterization of frontier testable tree languages | 1997-02-28 | Paper |
Confinement in the Coulomb gauge model. | 1997-01-01 | Paper |
AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS | 1994-03-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4281563 | 1994-03-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4036596 | 1993-05-18 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Thomas Wilke