The following pages link to (Q3862379):
Displaying 50 items.
- A note on Mod and generalised Mod classes (Q672491) (← links)
- Dynamical properties of PWD0L systems (Q673067) (← links)
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091) (← links)
- A note on P-selective sets and closeness (Q673619) (← links)
- Nondeterministic, probabilistic and alternating computations on cellular array models (Q673634) (← links)
- Optimal simulation of two-dimensional alternating finite automata by three-way nondeterministic Turing machines (Q673641) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Automaticity. IV: Sequences, sets, and diversity (Q679096) (← links)
- Automatic maps in exotic numeration systems (Q679441) (← links)
- Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates (Q680540) (← links)
- Specification and automatic verification of self-timed queues (Q685115) (← links)
- Testing for the ground (co-)reducibility property in term-rewriting systems (Q685352) (← links)
- Efficient constructions of test sets for regular and context-free languages (Q685373) (← links)
- On the non-existence of maximal inference degrees for language identification (Q685478) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- An essay on resolution logics (Q687163) (← links)
- Partial orders on words, minimal elements of regular languages, and state complexity (Q688156) (← links)
- Busy beaver competition and Collatz-like problems (Q688516) (← links)
- Multi-decision diagnosis: decentralized architectures cooperating for diagnosing the presence of faults in discrete event systems (Q692384) (← links)
- Introducing VAUCANSON (Q703498) (← links)
- Weak minimization of DFA -- an algorithm and applications (Q703502) (← links)
- Linear reachability problems and minimal solutions to linear Diophantine equation systems (Q703515) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- P systems with symport/antiport simulating counter automata (Q707498) (← links)
- Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
- Stochastic game logic (Q715046) (← links)
- From tree automata to string automata minimization (Q722214) (← links)
- A new pumping lemma for indexed languages, with an application to infinite words (Q729820) (← links)
- An algorithm for testing permutativeness of cellular automata (Q732363) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- On complete one-way functions (Q734307) (← links)
- Runtime analysis of probabilistic programs with unbounded recursion (Q743128) (← links)
- A formalization of multi-tape Turing machines (Q744986) (← links)
- The effective entropies of some extensions of context-free languages (Q751289) (← links)
- Turing machines with access to history (Q751802) (← links)
- Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
- Effective entropies and data compression (Q751832) (← links)
- A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes (Q756423) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- Regular sets over extended tree structures (Q764339) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- Fuzzy alternating automata over distributive lattices (Q781276) (← links)
- Computational complementarity (Q789384) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- Characterizations and computational complexity of systolic trellis automata (Q792091) (← links)
- Oracle-dependent properties of the lattice of NP sets (Q795829) (← links)
- Insertion languages (Q796994) (← links)
- Iterative tree automata (Q796998) (← links)
- The undecidability of the preperfectness of Thue systems (Q797574) (← links)
