Pages that link to "Item:Q5537615"
From MaRDI portal
The following pages link to A regularity test for pushdown machines (Q5537615):
Displayed 42 items.
- On the sizes of DPDAs, PDAs, LBAs (Q294936) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- New families of non real time dpda's and their decidability results (Q799385) (← links)
- On the separability of sparse context-free languages and of bounded rational relations (Q995585) (← links)
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
- On solving star equations (Q1085619) (← links)
- A hierarchy of deterministic languages (Q1136238) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- A graph-based regularity test for deterministic context-free languages (Q1177178) (← links)
- A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017) (← links)
- On LR(k) grammars and languages (Q1239009) (← links)
- Economy of description by parsers, DPDA's, and PDA's (Q1239011) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- \(\omega\)-computations on deterministic pushdown machines (Q1247962) (← links)
- Lower bounds on space complexity for contextfree recognition (Q1251077) (← links)
- On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
- Set of memories of a D-graph (Q1759072) (← links)
- Theory of formal grammars (Q1846334) (← links)
- On the degrees of non-regularity and non-context-freeness (Q2009649) (← links)
- Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358) (← links)
- LR-regular grammars - an extension of LR(k) grammars (Q2558004) (← links)
- Simplification Problems for Deterministic Pushdown Automata on Infinite Words (Q2800412) (← links)
- Set Automata (Q2814837) (← links)
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714) (← links)
- On reducing the number of stack symbols in a PDA (Q3141998) (← links)
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134) (← links)
- Decision problems among the main subfamilies of rational relations (Q3431438) (← links)
- Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
- (Q3873564) (← links)
- Equivalent transformations of metalinear LA(1) grammars and unary recursive schemes (Q3888557) (← links)
- Sur une propriété d'itération des langages algébriques déterministes (Q3925891) (← links)
- (Q3956423) (← links)
- On a subclass of context-free groups (Q3978768) (← links)
- Simple context-free languages and free monadic recursion schemes (Q4139703) (← links)
- On jump-deterministic pushdown automata (Q4141220) (← links)
- (Q5020647) (← links)
- (Q5091265) (← links)
- Self-Verifying Pushdown and Queue Automata (Q5164866) (← links)
- (Q5376652) (← links)
- ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA (Q5401559) (← links)
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS (Q5704376) (← links)
- Pushdown automata and constant height: decidability and bounds (Q6042073) (← links)