Deterministic context free languages

Cited in

(99)

A note on chains of deterministic pushdown transducers
Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
A pumping lemma for real-time deterministic context-free languages
An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
Superdeterministic DPDAs: The method of accepting does affect decision problems
One-way weak-stack-counter automata
Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations
The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine
On LLP(k) grammars and languages
An improved bound for detecting looping configurations in deterministic PDA's
Transductions des langages de Chomsky
Finite automata with multiplication
Normal forms of deterministic grammars
Equivalence problems for deterministic context-free languages and monadic recursion schemes
A strong pumping lemma for context-free languages
A decidability result for deterministic \(\omega\)-context-free languages
On LR(k) grammars and languages
On inverse deterministic pushdown transductions
Nondeterminism and Boolean operations in pda's
-computations on deterministic pushdown machines
On equivalence and subclass containment problems for deterministic context-free languages
A note on non-singular deterministic pushdown automata
A note on cyclic closure operations
On equivalence of grammars through transformation trees
Generalized overlap resolvable grammars and their parsers
A hierarchy of deterministic context-free \(\omega\)-languages.
\(L(A)=L(B)\)? decidability results from complete formal systems
One-counter pushdown-storage automata as transducers of sequences
Outfix-guided insertion
Accepting runs in a two-way finite automaton
Reversible pushdown automata
On store languages of language acceptors
Decidability of the equivalence problem for deterministic pushdown automata
Infinite regular Thue systems
An approach to deciding the observational equivalence of Algol-like languages
The inclusion problem for some subclasses of context-free languages
On the degrees of non-regularity and non-context-freeness
Syntax checking either way
Deterministic stack automata and the quotient operator
Properties of syntax directed translations
Une généralisation des ensembles de Dyck
Error detection in formal languages
On the relation between the class of all context-free languages and the class of deterministic context-free languages
LR-regular grammars - an extension of LR(k) grammars
Strict deterministic grammars
Input-driven languages are linear conjunctive
The effect of end-markers on counter machines and commutativity
Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-k storage automata
Outfix-guided insertion (extended abstract)
Aspects of reversibility for classical automata
scientific article; zbMATH DE number 3868645 (Why is no real title available?)
Unions of certain bounded deterministic languages
scientific article; zbMATH DE number 3677223 (Why is no real title available?)
Sur une propriété d'itération des langages algébriques déterministes
Conjunctive and Boolean grammars: the true general case of the context-free grammars
Stochastic grammars and languages
Necessary and sufficient conditions for a power language to be deterministic
Simple context-free languages and free monadic recursion schemes
On jump-deterministic pushdown automata
Comparing language operations
Refining nondeterminism in context-free languages
The complexity of the membership problem for some extensions of context-free languagest†
The equivalence problem for deterministic pushdown automata is decidable
On the density of context-free and counter languages
Invito alla teoria dei linguaggi formali
Input-Position-Restricted Models of Language Acceptors
State complexity of the quotient operation on input-driven pushdown automata
The Hoare logic of deterministic and nondeterministic monadic recursion schemes
Homomorphisms preserving deterministic context-free languages
A note on undecidable properties of formal languages
The theory of languages
A universal compiler system based on production rules
A Note on Pushdown Store Automata and Regular Systems
The theory of languages
THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
Investigations on automata and languages over a unary alphabet
Decidability of DPDA equivalence
On the complexity of decision problems for some classes of machines and applications
Lattice walks ending on a coordinate hyperplane avoiding backtracking and repeats
Syntax checking either way
Formal grammars for turn-bounded deterministic context-free languages
Nondeterministic auxiliary depth-bounded storage automata and semi-unbounded fan-in cascading circuits (extended abstract)
The Hardest LL(k) Language
Temporal logics with language parameters
\(\mathrm{GF}(2)\)-operations on basic families of formal languages
On the complexity of regular-grammars with integer attributes
Quasi-rocking real-time pushdown automata
Dissecting power of intersection of two context-free languages
Bisimulation equivalence of pushdown automata is Ackermann-complete
Left quotients of deterministic context-free languages
Deterministic pushdown automata with translucent input letters
On the containment problem for deterministic multicounter machine models
Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
A theory of injection-based vulnerabilities in formal grammars
Deterministic pushdown automata with translucent input letters
Store languages of Turing machines and counter machines
Intersections de langages algébriques bornes
The Boolean closure of linear context-free languages

This page was built for publication: Deterministic context free languages

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