The following pages link to (Q4131653):
Displayed 12 items.
- The intractability of computing the Hamming distance (Q557834) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- The ancestor width of grammars and languages (Q1274983) (← links)
- Growing context-sensitive languages and Church-Rosser languages (Q1383712) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- The complexity of ranking simple languages (Q3034844) (← links)
- Random Generation for Finitely Ambiguous Context-free Languages (Q3147017) (← links)
- String distances and intrusion detection: Bridging the gap between formal languages and computer security (Q3431441) (← links)
- Some modifications of auxiliary pushdown automata (Q3485868) (← links)
- Nonuniform complexity classes specified by lower and upper bounds (Q4730777) (← links)