Publication:5583856
From MaRDI portal
zbMath0189.29101MaRDI QIDQ5583856
Publication date: 1967
Related Items
The language intersection problem for non-recursive context-free grammars, Complexity of multi-head finite automata: origins and directions, Lower bounds on the size of deterministic parsers, Unresolved systems of language equations: expressive power and decision problems, The complexity of finding SUBSEQ\((A)\), Regulated nondeterminism in pushdown automata, Real-time reversible iterative arrays, Decision problems for language equations, Independence results about context-free languages and lower bounds, The finite power property for context-free languages, The complexity of computing the number of strings of given length in context-free languages, Reversal-bounded multipushdown machines, The Turing degree of the inherent ambiguity problem for context-free languages, An alternative approach to the improvement of LR(k) parsers, The inclusion problem for some subclasses of context-free languages, Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth, Some definitional suggestions for automata theory, The use of lists in the study of undecidable problems in automata theory, The complexity of ranking simple languages, Two-Party Watson-Crick Computations, Unnamed Item
