The following pages link to (Q3862379):
Displaying 50 items.
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Synthesis of communicating process skeletons from temporal-spatial logic specifications (Q1116944) (← links)
- An unpredictability approach to finite-state randomness (Q1117699) (← links)
- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy (Q1118405) (← links)
- The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\) (Q1118407) (← links)
- Approximate matching of regular expressions (Q1119025) (← links)
- Fairness in context-free grammars under every choice-strategy (Q1122988) (← links)
- An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group (Q1123272) (← links)
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs (Q1124332) (← links)
- A transformation system for generating description languages of chain code pictures (Q1124358) (← links)
- Characterization and closure properties of linear \(\omega\)-languages (Q1127314) (← links)
- On translations of temporal logic of actions into monadic second-order logic (Q1127537) (← links)
- On XRAM and PRAM models, and on data-movement-intensive problems (Q1127554) (← links)
- Localized planning with action-based constraints (Q1128485) (← links)
- Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages (Q1128670) (← links)
- Algebraic structures in categorial grammar (Q1129119) (← links)
- Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263) (← links)
- Formulae relating controllability, observability, and co-observability (Q1129683) (← links)
- Langages sur des alphabets infinis (Q1144383) (← links)
- The complexity of decision problems for finite-turn multicounter machines (Q1151753) (← links)
- On the complexity of simple arithmetic expressions (Q1162150) (← links)
- Thue congruences and the Church-Rosser property (Q1162505) (← links)
- A uniform approach to obtain diagonal sets in complexity classes (Q1164414) (← links)
- Physics of selective systems: Computation and biology (Q1164422) (← links)
- When is a monoid a group? The Church-Rosser case is tractable (Q1166924) (← links)
- Quadratic automata (Q1168081) (← links)
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis (Q1168733) (← links)
- Reduction and covering of infinite reachability trees (Q1173681) (← links)
- Algorithms for graph problems on BNLC structured garphs (Q1175948) (← links)
- Learning regular languages from counterexamples (Q1176104) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- On the degree of ambiguity of finite automata (Q1177168) (← links)
- Strong and robustly strong polynomial-time reducibilities to sparse sets (Q1177170) (← links)
- The complexity of Grigorchuk groups with application to cryptography (Q1177176) (← links)
- The implementation of a protocol using automata (Q1177388) (← links)
- Language in action (Q1177646) (← links)
- Alternation with a pebble (Q1178189) (← links)
- Minimizing the number of transitions with respect to observation equivalence (Q1182610) (← links)
- Knowledge representation for mathematical discovery: Three experiments in graph theory (Q1183372) (← links)
- The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
- On p-creative sets and p-completely creative sets (Q1183565) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- Learning in the presence of partial explanations (Q1183607) (← links)
- Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule (Q1183608) (← links)
- Concurrent regular expressions and their relationship to Petri nets (Q1184987) (← links)
- Languages whose \(n\)-element subsets are codes (Q1184989) (← links)
- Contractive presentations: A family of inverse monoids and semigroups with finite \({\mathcal R}\)-classes (Q1185779) (← links)
- Outfix and infix codes and related classes of languages (Q1186552) (← links)
- The parallel complexity of finite-state automata problems (Q1186807) (← links)
- Efficient learning of context-free grammars from positive structural examples (Q1186808) (← links)
