The following pages link to (Q4251040):
Displayed 26 items.
- Regular languages of thin trees (Q290908) (← links)
- Automata and logics over finitely varying functions (Q636272) (← links)
- On relation between linear temporal logic and quantum finite automata (Q783667) (← links)
- Pointlike sets and separation: a personal perspective (Q832918) (← links)
- A note on the characterization of TL [EF] (Q845961) (← links)
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- LTL is expressively complete for Mazurkiewicz traces (Q1608324) (← links)
- Finite-trace linear temporal logic: coinductive completeness (Q1667649) (← links)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
- Vectorial languages and linear temporal logic (Q1884965) (← links)
- Varieties (Q2074217) (← links)
- The stuttering principle revisited (Q2484066) (← links)
- Characterizing EF and EX tree logics (Q2503041) (← links)
- Unified temporal logic (Q2661764) (← links)
- Merge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic Pointlikes (Q3121327) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- On Shuffle Ideals (Q4405554) (← links)
- (Q4580330) (← links)
- Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
- Interval vs. Point Temporal Logic Model Checking (Q4617981) (← links)
- On All Things Star-Free (Q5092328) (← links)
- Backward Deterministic Büchi Automata on Infinite Words (Q5136295) (← links)
- Lang-n-Send Extended: Sending Regular Expressions to Monitors (Q6122642) (← links)
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages (Q6137830) (← links)
- On the translation of automata to linear temporal logic (Q6181926) (← links)
- First-order separation over countable ordinals (Q6181932) (← links)