scientific article; zbMATH DE number 3302285
From MaRDI portal
zbMath0189.29101MaRDI QIDQ5583856
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The chop of languages, Space Complexity of Stack Automata Models, The complexity of finding SUBSEQ\((A)\), Regulated nondeterminism in pushdown automata, Real-time reversible iterative arrays, String assembling systems: comparison to sticker systems and decidability, Syntax checking either way, The language intersection problem for non-recursive context-free grammars, Tinput-Driven Pushdown Automata, Unnamed Item, Conjunctive and Boolean grammars: the true general case of the context-free grammars, Complexity of multi-head finite automata: origins and directions, Boundary sets of regular and context-free languages, Queue Automata: Foundations and Developments, Pushdown and one-counter automata: constant and non-constant memory usage, The finite power property for context-free languages, Descriptional complexity of two-way pushdown automata with restricted head reversals, Unnamed Item, The complexity of computing the number of strings of given length in context-free languages, The inclusion problem for some subclasses of context-free languages, Self-Verifying Pushdown and Queue Automata, Computational completeness of equations over sets of natural numbers, The complexity of ranking simple languages, On the degrees of non-regularity and non-context-freeness, Decision problems for language equations, Reversal-bounded multipushdown machines, The Turing degree of the inherent ambiguity problem for context-free languages, Pushdown automata and constant height: decidability and bounds, Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth, Syntax checking either way, An alternative approach to the improvement of LR(k) parsers, Decision problems and projection languages for restricted variants of two-dimensional automata, One-Time Nondeterministic Computations, State Complexity of the Quotient Operation on Input-Driven Pushdown Automata, Two-Party Watson-Crick Computations, Some definitional suggestions for automata theory, Diving into the queue, The use of lists in the study of undecidable problems in automata theory, Language equations, Lower bounds on the size of deterministic parsers, Deterministic input-driven queue automata: finite turns, decidability, and closure properties, Space Complexity of Stack Automata Models, Independence results about context-free languages and lower bounds, Unresolved systems of language equations: expressive power and decision problems
