The following pages link to (Q4449212):
Displayed 26 items.
- On the almighty wand (Q418137) (← links)
- The algebraic theory of Parikh automata (Q722218) (← links)
- On a class of languages with holonomic generating functions (Q728269) (← links)
- XML schema, tree logic and sheaves automata (Q862561) (← links)
- ``Most of'' leads to undecidability: failure of adding frequencies to LTL (Q2233396) (← links)
- Capacitated automata and systems (Q2280332) (← links)
- On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\) (Q2399255) (← links)
- A positive extension of Eilenberg's variety theorem for non-regular languages (Q2666961) (← links)
- On the Almighty Wand (Q3540188) (← links)
- Combining Theories with Shared Set Operations (Q3655212) (← links)
- (Q4968382) (← links)
- Verifying quantitative temporal properties of procedural programs (Q5009429) (← links)
- (Q5089219) (← links)
- (Q5090498) (← links)
- On Reachability Problems for Low-Dimensional Matrix Semigroups (Q5091195) (← links)
- (Q5136335) (← links)
- (Q5155690) (← links)
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)
- Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)
- Decidable weighted expressions with Presburger combinators (Q5915759) (← links)
- Synchronization of Parikh automata (Q6067332) (← links)
- (Q6070602) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
- Jumping automata over Infinite words (Q6088920) (← links)
- On the existential arithmetics with addition and bitwise minimum (Q6091188) (← links)
- Unboundedness problems for machines with reversal-bounded counters (Q6091196) (← links)