Pages that link to "Item:Q4045649"

The following pages link to Regularity and Related Problems for Deterministic Pushdown Automata (Q4045649):

Displaying 34 items.

• On the sizes of DPDAs, PDAs, LBAs (Q294936) (← links)
• Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
• New families of non real time dpda's and their decidability results (Q799385) (← links)
• Generalized parenthesis languages and minimization of their parenthesis parts (Q800093) (← links)
• More concise representation of regular languages by automata and regular expressions (Q963066) (← 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)
• A hierarchy of deterministic languages (Q1136238) (← links)
• A graph-based regularity test for deterministic context-free languages (Q1177178) (← links)
• On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
• Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358) (← links)
• Rational subsets of partially reversible monoids (Q2378535) (← links)
• Simplification problems for deterministic pushdown automata on infinite words (Q2800412) (← links)
• Set automata (Q2814837) (← links)
• Descriptional Complexity of Bounded Regular Languages (Q2829978) (← 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)
• More Concise Representation of Regular Languages by Automata and Regular Expressions (Q3533024) (← links)
• Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
• (Q3873564) (← 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)
• (Q5089309) (← links)
• (Q5091265) (← links)
• (Q5094137) (← links)
• Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
• ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA (Q5401559) (← links)
• Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
• Definability Results for Top-Down Tree Transducers (Q6169966) (← links)
• Ramsey quantifiers over automatic structures: complexity and applications to verification (Q6649458) (← links)