scientific article; zbMATH DE number 1304310
From MaRDI portal
Publication:4251040
Recommendations
Cited in
(28)- LTL is expressively complete for Mazurkiewicz traces
- Finite-trace linear temporal logic: coinductive completeness
- Local temporal logic is expressively complete for cograph dependence alphabets
- Vectorial languages and linear temporal logic
- Varieties
- The stuttering principle revisited
- Characterizing EF and EX tree logics
- Unified temporal logic
- Regular languages of thin trees
- Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes
- Hierarchies and reducibilities on regular languages related to modulo counting
- On Shuffle Ideals
- The covering problem
- Expressiveness and succinctness of a logic of robustness
- Interval vs. point temporal logic model checking. An expressiveness comparison
- On All Things Star-Free
- Backward Deterministic Büchi Automata on Infinite Words
- Lang-n-Send Extended: Sending Regular Expressions to Monitors
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
- On the translation of automata to linear temporal logic
- First-order separation over countable ordinals
- Automata and logics over finitely varying functions
- Automata linear dynamic logic on finite traces
- Closing star-free closure
- On relation between linear temporal logic and quantum finite automata
- Pointlike sets and separation: a personal perspective
- A note on the characterization of TL [EF]
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251040)
