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