Real-Time Strict Deterministic Languages
From MaRDI portal
Cited in
(22)- Constructing a realtime deterministic pushdown automaton from a grammar
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
- A pumping lemma for real-time deterministic context-free languages
- Iteration theorems for families of strict deterministic languages
- The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine
- The equivalence problem for LL- and LR-regular grammars
- A hierarchy of real-time deterministic languages and their equivalence
- The inclusion problem for simple languages
- Normal forms of deterministic grammars
- On LR(k) grammars and languages
- A left part theorem for grammatical trees
- On equivalence of grammars through transformation trees
- Synchronizable deterministic pushdown automata and the decidability of their equivalence
- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars
- A new foundation for finitary corecursion and iterative algebras
- Strict deterministic grammars
- A new foundation for finitary corecursion. The locally finite fixpoint and its properties
- Decidable subcases of the equivalence problem for recursive program schemes
- scientific article; zbMATH DE number 3735179 (Why is no real title available?)
- On jump-deterministic pushdown automata
- New families of non real time dpda's and their decidability results
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
This page was built for publication: Real-Time Strict Deterministic Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5684249)
