The following pages link to Thomas Wilke (Q208756):
Displaying 50 items.
- Stutter-invariant temporal properties are expressible without the next-time operator (Q290250) (← links)
- Simulation relations for alternating Büchi automata (Q557801) (← links)
- An algebraic characterization of frontier testable tree languages (Q672861) (← links)
- Computing the rabin index of a regular language of infinite words (Q675222) (← links)
- Nesting until and since in linear temporal logic (Q705066) (← links)
- Profile trees for Büchi word automata, with application to determinization (Q897653) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- Confinement in the Coulomb gauge model. (Q1290467) (← links)
- (Q1588904) (redirect page) (← links)
- Nonlinear \(\sigma\)-model for gauge field disorder (Q1588905) (← links)
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic (Q1854353) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Transducer-based analysis of cryptographic protocols (Q2464141) (← links)
- First-order logic with two variables and unary temporal logic (Q2506493) (← links)
- Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy (Q2784480) (← links)
- Noninterference with Local Policies (Q2849922) (← links)
- Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata (Q2892766) (← links)
- Unifying Büchi Complementation Constructions. (Q2915686) (← links)
- Deciding strategy properties of contract-signing protocols (Q2946605) (← links)
- (Q3086936) (← links)
- Moderne Kryptographie (Q3090068) (← links)
- Computationally Sound Analysis of a Probabilistic Contract Signing Protocol (Q3182858) (← links)
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified (Q3521961) (← links)
- A characterization of first-order topological properties of planar spatial data (Q3546315) (← links)
- A Dolev-Yao-Based Definition of Abuse-Free Protocols (Q3591450) (← links)
- Simulation Relations for Alternating Parity Automata and Parity Games (Q3617046) (← links)
- (Q4036596) (← links)
- (Q4251040) (← links)
- (Q4281563) (← links)
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS (Q4285342) (← links)
- (Q4415252) (← links)
- (Q4415259) (← links)
- (Q4501666) (← links)
- (Q4535058) (← links)
- (Q4542541) (← links)
- Bounds for approximating MaxLinEq3-2 and MaxEkSat (Q4571892) (← links)
- Star-free picture expressions are strictly weaker than first-order logic (Q4571966) (← links)
- Past, Present, and Infinite Future (Q4598236) (← links)
- Algebras for classifying regular tree languages and an application to frontier testability (Q4630273) (← links)
- (Q4736862) (← links)
- (Q4785458) (← links)
- Unifying B\"uchi Complementation Constructions (Q4913776) (← links)
- (Q4938632) (← links)
- (Q4992510) (← links)
- Translating regular expressions into small ε-free nondeterministic finite automata (Q5047159) (← links)
- Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time (Q5096738) (← links)
- Backward Deterministic Büchi Automata on Infinite Words (Q5136295) (← links)
- A play on regular expressions (Q5176954) (← links)
- Computer Science Logic (Q5292642) (← links)
- Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata (Q5299843) (← links)
