Pages that link to "Item:Q5704376"
From MaRDI portal
The following pages link to THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS (Q5704376):
Displayed 16 items.
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Descriptional complexity of bounded context-free languages (Q383365) (← links)
- Expressiveness and static analysis of extended conjunctive regular path queries (Q389234) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Non-recursive trade-offs between two-dimensional automata and grammars (Q896688) (← links)
- Succinct description of regular languages by weak restarting automata (Q948085) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- The chop of languages (Q2358686) (← links)
- One-way reversible multi-head finite automata (Q2358688) (← links)
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714) (← links)
- SUBLINEARLY SPACE BOUNDED ITERATIVE ARRAYS (Q3056282) (← links)
- OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA (Q3526536) (← links)
- SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA (Q5173291) (← links)
- ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA (Q5401559) (← links)
- Languages generated by conjunctive query fragments of FC[REG] (Q6088950) (← links)
- Syntax checking either way (Q6100187) (← links)