The following pages link to Alternation (Q3928246):
Displaying 50 items.
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- On the structural simplicity of machines and languages (Q1924785) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- P-hardness of the emptiness problem for visibly pushdown languages (Q1944895) (← links)
- Deciding the word problem in pure double Boolean algebras (Q1948275) (← links)
- Fixed point guided abstraction refinement for alternating automata (Q1959653) (← links)
- Discrete-time control for rectangular hybrid automata (Q1960531) (← links)
- A characterization of alternating log time by ramified recurrence (Q1978645) (← links)
- Solving a PSPACE-complete problem with cP systems (Q1982985) (← links)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- On the efficiency of normal form systems for representing Boolean functions (Q1989340) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Alternation in two-way finite automata (Q2029487) (← links)
- Clocked population protocols (Q2040025) (← links)
- Positive announcements (Q2046881) (← links)
- Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment (Q2055791) (← links)
- A nondeterministic Turing machine variant to compute functions (Q2067632) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Width measures of alternating finite automata (Q2096586) (← links)
- Learning residual alternating automata (Q2105462) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)
- A symbolic decision procedure for symbolic alternating finite automata (Q2130584) (← links)
- Iterated covariant powerset is not a monad (Q2134821) (← links)
- On the decidability of infix inclusion problem (Q2163987) (← links)
- Model checking interval temporal logics with regular expressions (Q2182727) (← links)
- From QBFs to \textsf{MALL} and back via focussing (Q2209553) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- Transformation from PLTL to automata via NFGs (Q2253959) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- P systems attacking hard problems beyond NP: a survey (Q2299891) (← links)
- The model checking fingerprints of CTL operators (Q2317834) (← links)
- Query inseparability for \(\mathcal{ALC}\) ontologies (Q2321290) (← links)
- Trace semantics via determinization (Q2341701) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
- Synthesis of succinct systems (Q2353397) (← links)
- Kleisli, Parikh and Peleg compositions and liftings for multirelations (Q2360654) (← links)
- Quantum alternation (Q2361668) (← links)
- Parallel pointer machines (Q2366720) (← links)
- Modular strategies for recursive game graphs (Q2368953) (← links)
- The computational complexity of scenario-based agent verification and design (Q2372186) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor (Q2374390) (← links)
- Conjunctive grammars and alternating pushdown automata (Q2377302) (← links)
- A note on emptiness for alternating finite automata with a one-letter alphabet (Q2380016) (← links)
- Games for active XML revisited (Q2402614) (← links)
- The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic (Q2423779) (← links)
- Model checking open systems with alternating projection temporal logic (Q2424878) (← links)
- Model checking of pushdown systems for projection temporal logic (Q2424879) (← links)
