Pages that link to "Item:Q1099620"
From MaRDI portal
The following pages link to The method of forced enumeration for nondeterministic automata (Q1099620):
Displayed 45 items.
- What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\) (Q2009642) (← links)
- Orbit expandability of automaton semigroups and groups (Q2290646) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- On the complexity of the word problem for automaton semigroups and automaton groups (Q2363312) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems (Q2503275) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- Infinite vs. finite size-bounded randomized computations (Q2637645) (← links)
- A survey of two-dimensional automata theory (Q2638801) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA (Q2795309) (← links)
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (Q2817388) (← links)
- Complexity Theory Basics: NP and NL (Q2821692) (← links)
- Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs (Q2821694) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Optimal Reachability in Divergent Weighted Timed Games (Q2988366) (← links)
- Planarity Testing Revisited (Q3010433) (← links)
- Sublogarithmic $\sum _2$-space is not closed under complement and other separation results (Q3142269) (← links)
- Note on the complexity of Las Vegas automata problems (Q3421911) (← links)
- On the Complexity of k-Piecewise Testability and the Depth of Automata (Q3451116) (← links)
- Some modifications of auxiliary pushdown automata (Q3485868) (← links)
- Computing with cells: membrane systems – some complexity issues (Q3532791) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Structure and importance of logspace-MOD class (Q4009813) (← links)
- A note on balanced immunity (Q4032929) (← links)
- Relativized logspace and generalized quantifiers over finite ordered structures (Q4358054) (← links)
- On deciding some equivalences for concurrent processes (Q4362275) (← links)
- A hierarchy that does not collapse : alternations in low level space (Q4365021) (← links)
- Iteration of rational transductions (Q4508635) (← links)
- (Q4553282) (← links)
- (Q4580325) (← links)
- Minimal Reversible Deterministic Finite Automata (Q4640040) (← links)
- Alternating time versus deterministic time: A separation (Q4717057) (← links)
- Tailoring recursion for complexity (Q4858828) (← links)
- (Q4884649) (← links)
- (Q5111278) (← links)
- The complexity of weakly recognizing morphisms (Q5223827) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS (Q5495421) (← links)
- ON THE MINIMAL POLYNOMIAL OF A MATRIX (Q5696967) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Membership Problem for Two-Dimensional General Row Jumping Finite Automata (Q5859631) (← links)
- Decidability of Right One-Way Jumping Finite Automata (Q5859648) (← links)
- Minimal and Hyper-Minimal Biautomata (Q5890813) (← links)