Strict deterministic grammars
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3473266 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3307592 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- An Infinite Hierarchy of Context-Free Languages
- Characteristic and ultrarealtime languages
- Deterministic context free languages
- Internal and external stability of linear systems
- On the Parsing of Deterministic Languages
- On the capabilities of codes to correct synchronization errors
- On the translation of languages from left to right
- Real-Time Strict Deterministic Languages
Cited in
(42)- Musings around the geometry of interaction, and coherence
- Characteristic parsing: A framework for producing compact deterministic parsers. II
- On LR(k) grammars and languages
- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars
- Epsilon weak precedence grammars and languages
- Normal forms of deterministic grammars
- A survey of normal form covers for context-free grammars
- A hierarchy of deterministic languages
- Decidability of DPDA equivalence
- Deterministic finite automata with recursive calls and DPDAs
- A representation of trees by languages. II
- An improved bound for detecting looping configurations in deterministic PDA's
- The equivalence problem for LL- and LR-regular grammars
- A left part theorem for grammatical trees
- Theory of -languages. II: A study of various models of - type generation and recognition
- -computations on deterministic pushdown machines
- scientific article; zbMATH DE number 3677223 (Why is no real title available?)
- On LLP(k) parsers
- On LLP(k) grammars and languages
- An axiomatic approach to the Korenjak-Hopcroft algorithms
- Two decidability results for deterministic pushdown automata
- On jump-deterministic pushdown automata
- A representation of trees by languages. I
- Characteristic parsing: A framework for producing compact deterministic parsers. I
- Simple chain grammars and languages
- scientific article; zbMATH DE number 3735179 (Why is no real title available?)
- Equivalence of deterministic pushdown automata revisited
- Sur une propriété d'itération des langages algébriques déterministes
- On the covering of parsable grammars
- Decidable subcases of the equivalence problem for recursive program schemes
- Attributed translations
- scientific article; zbMATH DE number 3868645 (Why is no real title available?)
- Constructing a realtime deterministic pushdown automaton from a grammar
- DPDA's in 'Atomic normal form' and applications to equivalence problems
- Economy of description by parsers, DPDA's, and PDA's
- Recursion induction principle revisited
- Equivalence problems for deterministic context-free languages and monadic recursion schemes
- Simple context-free languages and free monadic recursion schemes
- A pumping lemma for real-time deterministic context-free languages
- A hierarchy of real-time deterministic languages and their equivalence
- Iteration theorems for families of strict deterministic languages
- On equivalence of grammars through transformation trees
This page was built for publication: Strict deterministic grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2560718)
