Pages that link to "Item:Q3821586"

The following pages link to Nondeterministic Space is Closed under Complementation (Q3821586):

Displaying 50 items.

• Logarithmic space and permutations (Q276248) (← links)
• Weak and strong one-way space complexity classes (Q293473) (← links)
• On the sizes of DPDAs, PDAs, LBAs (Q294936) (← links)
• Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
• Extending inclusion dependencies with conditions (Q386615) (← links)
• Model-checking hierarchical structures (Q414908) (← links)
• On the structure of linear apex NLC graph grammars (Q441855) (← links)
• An alternating hierarchy for finite automata (Q442279) (← links)
• Interval graph representation with given interval and intersection lengths (Q491160) (← links)
• Deciding determinism of regular languages (Q493651) (← links)
• Further remarks on DNA overlap assembly (Q515580) (← links)
• Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
• Computational complexity of finite asynchronous cellular automata (Q517039) (← links)
• Mediated population protocols (Q533894) (← links)
• Correctness of linear logic proof structures is NL-complete (Q534703) (← links)
• The computational power of membrane systems under tight uniformity conditions (Q537860) (← links)
• The equational complexity of Lyndon's algebra (Q539978) (← links)
• Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
• The lexicographically first topological order problem is NLOG-complete (Q582104) (← links)
• The strong exponential hierarchy collapses (Q584250) (← links)
• The language intersection problem for non-recursive context-free grammars (Q596298) (← links)
• Observations on complete sets between linear time and polynomial time (Q627129) (← links)
• Passively mobile communicating machines that use restricted space (Q650876) (← links)
• A note on algebras of languages (Q650885) (← links)
• On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems (Q671421) (← links)
• The expressiveness of a family of finite set languages (Q672126) (← links)
• On the acceptance power of regular languages (Q672323) (← links)
• Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
• Dynamical properties of PWD0L systems (Q673067) (← links)
• Multihead two-way probabilistic finite automata (Q675857) (← links)
• Methods for proving completeness via logical reductions (Q685391) (← links)
• Finite-model theory -- A personal perspective (Q688663) (← links)
• Low-complexity aggregation in GraphLog and Datalog (Q688669) (← links)
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
• Homonym population protocols (Q722223) (← links)
• Planar and grid graph reachability problems (Q733742) (← links)
• On the complexity of topological sorting (Q750150) (← links)
• Effective entropies and data compression (Q751832) (← links)
• A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
• Finite-automaton aperiodicity is PSPACE-complete (Q809608) (← links)
• Linearly bounded infinite graphs (Q852011) (← links)
• The complexity of membership problems for circuits over sets of integers (Q861262) (← links)
• Positive and negative proofs for circuits and branching programs (Q896677) (← links)
• Boundary sets of regular and context-free languages (Q896680) (← links)
• The complexity of regular DNLC graph languages (Q909473) (← links)
• New developments in structural complexity theory (Q913509) (← links)
• The difference between one tape and two tapes: With respect to reversal complexity (Q920983) (← links)
• The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
• On three-way two-dimensional Turing machines (Q1116697) (← links)
• A hierarchy of propositional Horn formuls (Q1122571) (← links)