The following pages link to (Q3707407):
Displaying 50 items.
- On the equivalence of distributed systems with queries and communication (Q389221) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Boundary sets of regular and context-free languages (Q896680) (← links)
- Reversal complexity revisited (Q935164) (← links)
- The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
- Reversal-bounded nondeterministic multicounter machines and complementation (Q1094884) (← links)
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- The problem of space invariance for sequential machines (Q1102112) (← links)
- On reversal bounded alternating Turing machines (Q1102114) (← links)
- More complicated questions about maxima and minima, and some closures of NP (Q1107524) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- A survey of space complexity (Q1193412) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- Unambiguity of circuits (Q1208408) (← links)
- Language complexity of rotations and Sturmian sequences (Q1274922) (← links)
- The ancestor width of grammars and languages (Q1274983) (← links)
- The polynomially exponential time restrained analytical hierarchy (Q1337640) (← links)
- Classification of the index sets of low \([n]^ p\) and high \([n]^ p\) (Q1337641) (← links)
- The complexity of PDL with interleaving (Q1351943) (← links)
- Recursion theoretic characterizations of complexity classes of counting functions (Q1365942) (← links)
- The code problem for traces -- improving the boundaries (Q1392032) (← links)
- Realtime subshifts (Q1566732) (← links)
- On the computational complexity of problems related to distinguishability sets (Q1706155) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- The power of two-way deterministic checking stack automata (Q1812540) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Nondeterministic multicounter machines and complementation (Q1825044) (← links)
- Deterministic Turing machines in the range between real-time and linear-time. (Q1853527) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- On the descriptional complexity of Watson-Crick automata (Q2271460) (← links)
- On complexity of grammars related to the safety problem (Q2465626) (← links)
- A time lower bound for satisfiability (Q2581273) (← links)
- ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA (Q2909225) (← links)
- A Note on a Tree-Based 2D Indexing (Q3073649) (← links)
- Limiting characterizations of low level space complexity classes (Q3142271) (← links)
- Constructions for alternating finite automata<sup>∗</sup> (Q3477972) (← links)
- Some modifications of auxiliary pushdown automata (Q3485868) (← links)
- Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) (Q3489983) (← links)
- REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS (Q3526540) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- On the expressive power of the shuffle operator matched with intersection by regular sets (Q4331053) (← links)
- SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS (Q4337484) (← links)
- The equivalence of pebbles and sensing heads for finite automata (Q5055952) (← links)
- Weak parallel machines: A new class of physically feasible parallel machine models (Q5096822) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
- (Q5867525) (← links)
