The following pages link to Alternation (Q3928246):
Displaying 24 items.
- Converting finite width AFAs to nondeterministic and universal finite automata (Q6131195) (← links)
- A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings (Q6137852) (← links)
- Probabilism versus Alternation for Automata (Q6163621) (← links)
- Jump complexity of finite automata with translucent letters (Q6190004) (← links)
- Operations on Boolean and Alternating Finite Automata (Q6204121) (← links)
- Simplifying Alternating Automata for Emptiness Testing (Q6488157) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← links)
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\) (Q6535408) (← links)
- Model checking timed recursive CTL (Q6543268) (← links)
- Hybrid modal operators for definite descriptions (Q6545576) (← links)
- Bounded fixed-point definability and tabular recognition of languages (Q6560180) (← links)
- Relations among parallel and sequential computation models (Q6560351) (← links)
- An automata-theoretic approach to linear temporal logic (Q6560392) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
- On homeostatic behavior of dynamic deductive data bases (Q6570940) (← links)
- Parallel machine models: how they are and where are they going (Q6573922) (← links)
- On the decidability of infix inclusion problem (Q6580072) (← links)
- On two-variable guarded fragment logic with expressive local Presburger constraints (Q6597967) (← links)
- Theoretical computer science: computational complexity (Q6602263) (← links)
- Minimisation in logical form (Q6612779) (← links)
- Towards the exact complexity of realizability for safety LTL (Q6615568) (← links)
- Parity games on temporal graphs (Q6629452) (← links)
- On the power of automata minimization in reactive synthesis (Q6649518) (← links)
- A Nivat theorem for weighted alternating automata over commutative semirings (Q6649528) (← links)
