Pages that link to "Item:Q1099620"
From MaRDI portal
The following pages link to The method of forced enumeration for nondeterministic automata (Q1099620):
Displayed 50 items.
- Model-checking hierarchical structures (Q414908) (← links)
- An alternating hierarchy for finite automata (Q442279) (← links)
- The equational complexity of Lyndon's algebra (Q539978) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Observations on complete sets between linear time and polynomial time (Q627129) (← links)
- A note on algebras of languages (Q650885) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
- Linearly bounded infinite graphs (Q852011) (← links)
- The complexity of membership problems for circuits over sets of integers (Q861262) (← links)
- The complexity of regular DNLC graph languages (Q909473) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- A communication hierarchy of parallel computations (Q1129258) (← links)
- On ``inherently context-sensitive'' languages -- an application of complexity cores (Q1183427) (← links)
- The parallel complexity of finite-state automata problems (Q1186807) (← links)
- The complexity of circuit value and network stability (Q1190989) (← links)
- Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
- A survey of space complexity (Q1193412) (← links)
- A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017) (← links)
- The parallel complexity of coarsest set partition problems (Q1198030) (← links)
- A very hard log-space counting class (Q1208403) (← links)
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- The alternation hierarchy for sublogarithmic space is infinite (Q1312177) (← links)
- Census techniques collapse space classes (Q1332770) (← links)
- Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670) (← links)
- DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization (Q1362330) (← links)
- Space hierarchy theorem revised. (Q1401238) (← links)
- The complexity of the characteristic and the minimal polynomial. (Q1401240) (← links)
- A space lower bound for \(st\)-connectivity on node-named JAGs (Q1566733) (← links)
- A variant of inductive counting (Q1566745) (← links)
- A note on closure properties of logspace MOD classes (Q1583060) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space (Q1825656) (← links)
- For completeness, sublogarithmic space is no space. (Q1853022) (← links)
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers (Q1854455) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- Bounded MSC communication (Q1881218) (← links)
- The complexity of planarity testing (Q1887150) (← links)
- A note on logspace optimization (Q1904668) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)