The following pages link to (Q3862379):
Displaying 50 items.
- Extended multi bottom-up tree transducers (Q1038420) (← links)
- Applications of automata and graphs: Labeling-operators in Hilbert space. I (Q1038729) (← links)
- Prediction, retrodiction, and the amount of information stored in the present (Q1040715) (← links)
- Maximum likelihood analysis of algorithms and data structures (Q1041238) (← links)
- Tests for the LR-, LL-, and LC-regular conditions (Q1050124) (← links)
- The undecidability of self-embedding for term rewriting systems (Q1061484) (← links)
- Depth-first iterative-deepening: An optimal admissible tree search (Q1062761) (← links)
- Complete problems for space bounded subclasses of NP (Q1064779) (← links)
- Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer (Q1065546) (← links)
- Test sets for morphisms with bounded delay (Q1067414) (← links)
- On one-one polynomial time equivalence relations (Q1068536) (← links)
- On two problems related to cancellativity (Q1070349) (← links)
- Computation theory of cellular automata (Q1072705) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- String-matching cannot be done by a two-head one-way deterministic finite automaton (Q1075776) (← links)
- Control and data driven execution of logic programs: A comparison (Q1083186) (← links)
- Toward a quantitative theory of self-generated complexity (Q1084370) (← links)
- Complexity of certain decision problems about congruential languages (Q1085618) (← links)
- Continuous optimization problems and a polynomial hierarchy of real functions (Q1086557) (← links)
- Microeconomic foundations of cyclical irregularities or ''chaos'' (Q1089240) (← links)
- Monoids with disjunctive identity and their codes (Q1091482) (← links)
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines (Q1094140) (← links)
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes (Q1094874) (← links)
- On the continued fraction representation of computable real numbers (Q1096627) (← links)
- A comparison of polynomial time completeness notions (Q1097692) (← links)
- Identification of pattern languages from examples and queries (Q1097709) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Algorithms for the compilation of regular expressions into PLAs (Q1098299) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- Recognizing safety and liveness (Q1100884) (← links)
- Social choice and computational complexity (Q1101310) (← links)
- Computing power series in polynomial time (Q1102956) (← links)
- Programming simultaneous actions using common knowledge (Q1104074) (← links)
- Polynomial terse sets (Q1104077) (← links)
- Parallel complexity of logical query programs (Q1104095) (← links)
- Intractable problems in reversible cellular automata (Q1104752) (← links)
- The word and generator problems for lattices (Q1105626) (← links)
- Complexity, combinatorial group theory and the language of palutators (Q1105698) (← links)
- On characterizations of the class PSPACE/poly (Q1107320) (← links)
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation (Q1108988) (← links)
- Complexity classes without machines: on complete languages for UP (Q1109566) (← links)
- Promise problems complete for complexity classes (Q1109568) (← links)
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors (Q1109707) (← links)
- Collapsing degrees (Q1109766) (← links)
- Implication of clauses is undecidable (Q1110493) (← links)
- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs (Q1111384) (← links)
- Modular supervisory control of discrete-event systems (Q1113863) (← links)
- A measure of relativized space which is faithful with respect to depth (Q1115190) (← links)
- Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973) (← links)
