Pages that link to "Item:Q4268872"
From MaRDI portal
The following pages link to Regular Closure of Deterministic Languages (Q4268872):
Displaying 12 items.
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- Fast parallel recognition of LR language suffixes (Q834947) (← links)
- Regulated nondeterminism in pushdown automata (Q840763) (← links)
- Context-dependent nondeterminism for pushdown automata (Q880177) (← links)
- Detecting useless transitions in pushdown automata (Q2042722) (← links)
- A pumping lemma for regular closure of prefix-free languages (Q2105458) (← links)
- Boolean kernels of context-free languages (Q2117675) (← links)
- Finite turns and the regular closure of linear context-free languages (Q2384399) (← links)
- Kernels of Sub-classes of Context-Free Languages (Q3297763) (← links)
- Regulated Nondeterminism in Pushdown Automata (Q3503897) (← links)
- On Extended Regular Expressions (Q3618588) (← links)
- Detecting Useless Transitions in Pushdown Automata (Q5739015) (← links)