The following pages link to (Q5636862):
Displaying 50 items.
- Complexity of detectability, opacity and A-diagnosability for modular discrete event systems (Q1737732) (← links)
- On the size complexity of hybrid networks of evolutionary processors (Q1763710) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- Some notes on strong and weak log log n space complexity (Q1824397) (← 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)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- Characterization of realizable space complexities (Q1892934) (← links)
- Amount of nonconstructivity in deterministic finite automata (Q1959651) (← links)
- Two-way automata versus logarithmic space (Q2254505) (← links)
- Computational power of one-way Turing machines with sublogarithmic memory restrictions (Q2262923) (← links)
- P-RAM vs. RP-RAM (Q2402257) (← links)
- Multitape one-way nonwriting automata (Q2527943) (← links)
- Principal AFL (Q2540269) (← links)
- Writing pushdown acceptors (Q2540271) (← links)
- Time- and tape-bounded Turing acceptors and AFLs (Q2542726) (← links)
- On the computational power of pushdown automata (Q2542990) (← links)
- The enumerability and invariance of complexity classes (Q2545514) (← links)
- Complexity problems in real time languages (Q2547547) (← links)
- On non-determinacy in simple computing devices (Q2550291) (← links)
- Writing stack acceptors (Q2554233) (← links)
- Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata (Q2558752) (← links)
- A survey of two-dimensional automata theory (Q2638801) (← links)
- An automaton group with \textsf{PSPACE}-complete word problem (Q2701072) (← links)
- A space lower bound for acceptance by one-way \(\Pi_2\)-alternating machines (Q2720409) (← links)
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (Q2817388) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Two-Way Automata versus Logarithmic Space (Q3007639) (← links)
- Sublogarithmic $\sum _2$-space is not closed under complement and other separation results (Q3142269) (← links)
- Automata theory on sliding windows (Q3304130) (← links)
- Amount of Nonconstructivity in Finite Automata (Q3637360) (← links)
- Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties (Q3811712) (← links)
- Relativization of questions about log space computability (Q4109299) (← links)
- An application of the translational method (Q4285626) (← links)
- A hierarchy that does not collapse : alternations in low level space (Q4365021) (← links)
- Complexity of probabilistic versus deterministic automata (Q4560366) (← links)
- (Q4643954) (← links)
- Alternating time versus deterministic time: A separation (Q4717057) (← links)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
- The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic (Q4989164) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- Space-bounded OTMs and REG ∞ (Q5037216) (← links)
- Minimal Size of Counters for (Real-Time) Multicounter Automata (Q5158661) (← links)
- The theory of languages (Q5551468) (← links)
- A note on one-way and two-way automata (Q5582343) (← links)
- The theory of languages (Q5592247) (← links)
- On restricted turing computability (Q5632561) (← links)
- Subrecursiveness: Machine-independent notions of computability in restricted time and storage (Q5637881) (← links)
- Improved average complexity for comparison-based sorting (Q5919334) (← links)
