Pages that link to "Item:Q4776849"
From MaRDI portal
The following pages link to Jump PDA’s and Hierarchies of Deterministic Context-Free Languages (Q4776849):
Displayed 20 items.
- New families of non real time dpda's and their decidability results (Q799385) (← links)
- The hardest \(\operatorname{LL}(k)\) language (Q832952) (← links)
- Remarks on multihead pushdown automata and multihead stack automata (Q1052822) (← links)
- Equivalence problems for deterministic context-free languages and monadic recursion schemes (Q1238426) (← links)
- On inverse deterministic pushdown transductions (Q1245575) (← links)
- Nondeterminism and Boolean operations in pda's (Q1245576) (← links)
- Opérations de cylindre et applications séquentielles gauches inverses (Q1250714) (← links)
- Une note sur le cylindre des langages déterministes (Q1254106) (← links)
- Générateurs algébriques et systèmes de paires iterantes (Q1258610) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- (Q3335012) (← links)
- (Q3873564) (← links)
- Non-prinicipalité du cylindre des langages à compteur (Q4121409) (← links)
- Le cylindre des langages linéaires (Q4122824) (← links)
- On jump-deterministic pushdown automata (Q4141220) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
- The hardest language for grammars with context operators (Q6038689) (← links)
- The Hardest LL(k) Language (Q6169967) (← links)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)