Pages that link to "Item:Q594584"

The following pages link to On Goedel speed-up and succinctness of language representations (Q594584):

Displaying 19 items.

• Extended regular expressions: succinctness and decidability (Q372977) (← links)
• Expressiveness and static analysis of extended conjunctive regular path queries (Q389234) (← links)
• Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
• New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems (Q804570) (← links)
• Document spanners: from expressive power to decision problems (Q1650917) (← links)
• The chop of languages (Q2358686) (← 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)
• Concise representations of regular languages by degree and probabilistic finite automata (Q3142004) (← links)
• Program Size Complexity of Correction Grammars in the Ershov Hierarchy (Q3188262) (← links)
• Two recursion theoretic characterizations of proof speed-ups (Q3480036) (← links)
• (Q4988162) (← links)
• Self-Verifying Pushdown and Queue Automata (Q5164866) (← links)
• One-Time Nondeterministic Computations (Q5205043) (← links)
• ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA (Q5401559) (← links)
• NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES (Q5704375) (← links)
• THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS (Q5704376) (← links)
• Descriptional complexity of finite automata -- selected highlights (Q6614536) (← links)
• Languages generated by conjunctive query fragments of FC[REG] (Q6661764) (← links)