Pages that link to "Item:Q963066"

The following pages link to More concise representation of regular languages by automata and regular expressions (Q963066):

Displaying 16 items.

• The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← links)
• Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
• Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
• On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
• The descriptional power of queue automata of constant length (Q2041686) (← links)
• Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
• Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
• A note on controllability of deterministic context-free~systems (Q2391510) (← links)
• Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
• Processing succinct matrices and vectors (Q2411035) (← links)
• The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata (Q5200083) (← links)
• Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
• Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
• Regular expression length via arithmetic formula complexity (Q5918469) (← links)
• Pushdown automata and constant height: decidability and bounds (Q6042073) (← links)