scientific article; zbMATH DE number 522856
From MaRDI portal
Publication:4284250
zbMath0794.68085MaRDI QIDQ4284250
Markus Holzer, Klaus-Joern Lange
Publication date: 31 August 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Related Items (17)
On the closure properties of linear conjunctive languages. ⋮ On the Transformation of LL(k)-linear Grammars to LL(1)-linear ⋮ Degrees of non-monotonicity for restarting automata ⋮ Syntax checking either way ⋮ Streaming algorithms for language recognition problems ⋮ On linear languages recognized by deterministic biautomata ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ On the transformation of LL\((k)\)-linear to LL(1)-linear grammars ⋮ On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata ⋮ McNaughton families of languages. ⋮ A Taxonomy of Deterministic Forgetting Automata ⋮ Hardest languages for conjunctive and Boolean grammars ⋮ Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} ⋮ Leaf languages and string compression ⋮ Syntax checking either way ⋮ Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata ⋮ On The Space Complexity Of Turn Bounded Pushdown Automata
This page was built for publication:
