scientific article; zbMATH DE number 3560742
From MaRDI portal
Publication:4131653
Cited in
(16)- The intractability of computing the Hamming distance
- Non-commutative arithmetic circuits: depth reduction and size lower bounds
- On the complexity of regular-grammars with integer attributes
- String distances and intrusion detection: Bridging the gap between formal languages and computer security
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
- On growing context-sensitive languages
- How hard is to compute the edit distance
- Tradeoff lower lounds for stack machines
- Nonuniform complexity classes specified by lower and upper bounds
- How hard is computing the edit distance?
- Tradeoffs for language recognition on alternating machines
- The complexity of ranking simple languages
- Some modifications of auxiliary pushdown automata
- Random Generation for Finitely Ambiguous Context-free Languages
- Growing context-sensitive languages and Church-Rosser languages
- The ancestor width of grammars and languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131653)
