Pages that link to "Item:Q4158497"
From MaRDI portal
The following pages link to On the Tape Complexity of Deterministic Context-Free Languages (Q4158497):
Displaying 50 items.
- An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- On the complexity of regular-grammars with integer attributes (Q632805) (← links)
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Interactive proof systems and alternating time-space complexity (Q685437) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Pattern selector grammars and several parsing algorithms in the context- free style (Q1081314) (← links)
- On the relative complexity of some languages in \(NC^ 1\) (Q1124355) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- Upper and lower bounds for first order expressibility (Q1173404) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- Nonuniform complexity and the randomness of certain complete languages (Q1184988) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- Unambiguity of circuits (Q1208408) (← links)
- On inverse deterministic pushdown transductions (Q1245575) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- Properties of probabilistic pushdown automata (Q1274989) (← links)
- Restricted CRCW PRAMs (Q1314395) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Growing context-sensitive languages and Church-Rosser languages (Q1383712) (← links)
- McNaughton families of languages. (Q1401181) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
- Self-reducibility (Q2639637) (← links)
- Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata (Q2695283) (← links)
- Branching Programs for Tree Evaluation (Q3182923) (← links)
- Complexity of boundary graph languages (Q3479528) (← links)
- Some modifications of auxiliary pushdown automata (Q3485868) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata (Q3503642) (← links)
- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (Q3618608) (← links)
- (Q3657451) (← links)
- Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata (Q3816981) (← links)
- On relativizing auxiliary pushdown machines (Q3862402) (← links)
- Time and space complexity of inside-out macro languages (Q3922197) (← links)
- Properties of probabilistic pushdown automata (Q5055907) (← links)
- Reversals and alternation (Q5096156) (← links)
- On weak growing context-sensitive grammars (Q5096331) (← links)
