scientific article; zbMATH DE number 3560742
From MaRDI portal
Publication:4131653
zbMath0359.68055MaRDI QIDQ4131653
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. ⋮ How hard is to compute the edit distance ⋮ Tradeoffs for language recognition on alternating machines ⋮ Some modifications of auxiliary pushdown automata ⋮ Growing context-sensitive languages and Church-Rosser languages ⋮ On the complexity of regular-grammars with integer attributes ⋮ The complexity of ranking simple languages ⋮ The intractability of computing the Hamming distance ⋮ On growing context-sensitive languages ⋮ Tradeoff lower lounds for stack machines ⋮ Non-commutative arithmetic circuits: depth reduction and size lower bounds ⋮ The ancestor width of grammars and languages ⋮ Nonuniform complexity classes specified by lower and upper bounds ⋮ String distances and intrusion detection: Bridging the gap between formal languages and computer security ⋮ How hard is computing the edit distance? ⋮ Random Generation for Finitely Ambiguous Context-free Languages
This page was built for publication:
