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