The following pages link to Theoretical Computer Science (Q123643):
Displaying 50 items.
- The complexity of Grigorchuk groups with application to cryptography (Q1177176) (← links)
- A graph-based regularity test for deterministic context-free languages (Q1177178) (← links)
- A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
- Graph grammars with path-controlled embedding (Q1177180) (← links)
- Semantic models for concurrent logic languages (Q1177921) (← links)
- An analysis of loop checking mechanisms for logic programs (Q1177923) (← links)
- Acyclic logic programs and the completeness of SLDNF-resolution (Q1177925) (← links)
- Semantics of Horn and disjunctive logic programs (Q1177928) (← links)
- Unfold/fold transformation of stratified programs (Q1177929) (← links)
- Complete systems of \(\mathcal B\)-rational identities (Q1177930) (← links)
- Languages and scanners (Q1177931) (← links)
- Maximal codes with bounded deciphering delay (Q1177932) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
- Order-sorted completion: The many-sorted way (Q1177935) (← links)
- Horn clause programs with polymorphic types: Semantics and resolution (Q1177936) (← links)
- Type checking with universes (Q1177937) (← links)
- Metacircularity in the polymorphic \(\lambda\)-calculus (Q1177938) (← links)
- Local model checking in the modal mu-calculus (Q1177939) (← links)
- Specification styles in distributed systems design and verification (Q1177943) (← links)
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields (Q1178687) (← links)
- Generalized automata on infinite trees and Muller-McNaughton's theorem (Q1178688) (← links)
- Optimal covering of cacti by vertex-disjoint paths (Q1178689) (← links)
- Bounded queries to SAT and the Boolean hierarchy (Q1178690) (← links)
- Computations over finite monoids and their test complexity (Q1178692) (← links)
- Which Kleene semigroups are finite? (Q1178693) (← links)
- Bounded delay L codes (Q1178694) (← links)
- Multidimensional trees (Q1178697) (← links)
- Resolution for some first-order modal systems (Q1178699) (← links)
- Completion for unification (Q1178701) (← links)
- Hypermap rewriting: A combinatorial approach (Q1178702) (← links)
- Continuations in possible-world semantics (Q1178704) (← links)
- Proof normalization with nonstandard objects (Q1178706) (← links)
- Coherence spaces are untopological (Q1178707) (← links)
- Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u]/\langle{} u^ n \rangle\) (Q1178708) (← links)
- Recognizable closures and submonoids of free partially commutative monoids (Q1178709) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (Q1178711) (← links)
- Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words) (Q1178712) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- An algebra of mixed computation (Q1179696) (← links)
- Static semantics, types, and binding time analysis (Q1179698) (← links)
- Four domains for concurrency (Q1179700) (← links)
- An algebra of concurrent non-deterministic processes (Q1179704) (← links)
- Connectedness and synchronization (Q1179707) (← links)
- Rapid construction of algebraic axioms from samples (Q1179710) (← links)
- A bridge between constructive logic and computer programming (Q1179711) (← links)
- On p-creative sets and p-completely creative sets (Q1183565) (← links)
- Finitely generated bi\(\omega\)-languages (Q1183567) (← links)
- Parallel parsing on a one-way linear array of finite-state machines (Q1183569) (← links)
