scientific article
From MaRDI portal
Publication:3774982
zbMath0635.68085MaRDI QIDQ3774982
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
pumping lemmaabstract family of languagescomplexity of computationsalmost context-free languagesone-way auxiliary pushdown automaton
Related Items (3)
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. ⋮ On the intersection of the class of linear context-free languages and the class of single-reset languages ⋮ The ancestor width of grammars and languages
This page was built for publication: