scientific article
From MaRDI portal
Publication:3102144
zbMath1227.68033MaRDI QIDQ3102144
Publication date: 1 December 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The chop of languages ⋮ One-way reversible multi-head finite automata ⋮ On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata ⋮ Document spanners: from expressive power to decision problems ⋮ Boolean language operations on nondeterministic automata with a pushdown of constant height ⋮ Extended regular expressions: succinctness and decidability ⋮ Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* ⋮ Descriptional complexity of bounded context-free languages ⋮ Unnamed Item ⋮ Boundary sets of regular and context-free languages ⋮ Lyndon partial words and arrays with applications ⋮ Cellular Automata: Descriptional Complexity and Decidability ⋮ Queue Automata: Foundations and Developments ⋮ On the undecidability and descriptional complexity of synchronized regular expressions ⋮ Nondeterministic state complexity of star-free languages ⋮ A hitchhiker's guide to descriptional complexity through analytic combinatorics ⋮ On a structural property in the state complexity of projected regular languages ⋮ Descriptional complexity of two-way pushdown automata with restricted head reversals ⋮ Unnamed Item ⋮ Iterated uniform finite-state transducers on unary languages ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Self-Verifying Pushdown and Queue Automata ⋮ Removing nondeterminism in constant height pushdown automata ⋮ Oblivious two-way finite automata: decidability and complexity ⋮ A multi-parameter analysis of hard problems on deterministic finite automata ⋮ Hierarchies and undecidability results for iterative arrays with sparse communication ⋮ Syntax checking either way ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions ⋮ Nondeterministic State Complexity of Star-Free Languages ⋮ State Complexity of Projected Languages ⋮ Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals ⋮ One-Time Nondeterministic Computations ⋮ Input-driven multi-counter automata ⋮ The descriptional power of queue automata of constant length ⋮ Descriptional complexity of iterated uniform finite-state transducers ⋮ Deterministic input-driven queue automata: finite turns, decidability, and closure properties ⋮ Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power ⋮ Boolean kernels of context-free languages
