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 9 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)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Growing context-sensitive languages and Church-Rosser languages (Q1383712) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)
- StUSPACE(log n) ⊂-DSPACE(log2 n/log log n) (Q6487439) (← links)
