scientific article; zbMATH DE number 3302285

Cited in

(49)

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
On the degrees of non-regularity and non-context-freeness
Decision problems and projection languages for restricted variants of two-dimensional automata
Language equations
String assembling systems: comparison to sticker systems and decidability
Syntax checking either way
Computational completeness of equations over sets of natural numbers
Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
Deterministic input-driven queue automata: finite turns, decidability, and closure properties
The chop of languages
Some definitional suggestions for automata theory
The use of lists in the study of undecidable problems in automata theory
Tinput-Driven Pushdown Automata
The complexity of ranking simple languages
Two-party Watson-Crick computations
scientific article; zbMATH DE number 3808971 (Why is no real title available?)
Conjunctive and Boolean grammars: the true general case of the context-free grammars
Descriptional complexity of two-way pushdown automata with restricted head reversals
Automata that may change their mind
Space complexity of stack automata models
Queue Automata: Foundations and Developments
Self-verifying pushdown and queue automata
One-time nondeterministic computations
State complexity of the quotient operation on input-driven pushdown automata
Diving into the queue
The language intersection problem for non-recursive context-free grammars
Pushdown automata and constant height: decidability and bounds
Syntax checking either way
Complexity of multi-head finite automata: origins and directions
Space Complexity of Stack Automata Models
Pushdown and one-counter automata: constant and non-constant memory usage
Descriptional complexity of finite automata -- selected highlights
Turn complexity of context-free languages, pushdown and one-counter automata
Decision problems for systems of language equations and inequations
Pushdown and one-counter automata: constant and non-constant memory usage
The pumping lemma for context-free languages is undecidable
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
Boundary sets of regular and context-free languages
Decision problems for language equations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5583856)