scientific article
From MaRDI portal
Publication:3219133
zbMath0555.68046MaRDI QIDQ3219133
Burchard von Braunmühl, Rutger Verbeek
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (25)
An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages ⋮ Descriptional Complexity of Input-Driven Pushdown Automata ⋮ Input-driven languages are linear conjunctive ⋮ State complexity of operations on input-driven pushdown automata ⋮ On the power of pushing or stationary moves for input-driven pushdown automata ⋮ Log-space algorithms for paths and matchings in \(k\)-trees ⋮ Tinput-Driven Pushdown Automata ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Extending Wagner's hierarchy to deterministic visibly pushdown automata ⋮ Sweeping input-driven pushdown automata ⋮ When input-driven pushdown automata meet reversiblity ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ Descriptional complexity of unambiguous input-driven pushdown automata ⋮ Operator precedence and the visibly pushdown property ⋮ Further closure properties of input-driven pushdown automata ⋮ On the power of pushing or stationary moves for input-driven pushdown automata ⋮ State Complexity of the Quotient Operation on Input-Driven Pushdown Automata ⋮ Input-driven multi-counter automata ⋮ Input-driven pushdown automata for edit distance neighborhood ⋮ Edit distance neighbourhoods of input-driven pushdown automata ⋮ Edit distance neighbourhoods of input-driven pushdown automata ⋮ On the determinization of event-clock input-driven pushdown automata ⋮ Deterministic input-driven queue automata: finite turns, decidability, and closure properties ⋮ Digging input-driven pushdown automata ⋮ Input-driven pushdown automata on well-nested infinite strings
This page was built for publication:
