Pages that link to "Item:Q2381504"
From MaRDI portal
The following pages link to Lower bound technique for length-reducing automata (Q2381504):
Displayed 8 items.
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Probabilistic length-reducing two-pushdown automata (Q841617) (← links)
- A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems (Q844899) (← links)
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA (Q3056279) (← links)
- (Q4988164) (← links)
- Two-Sided Strictly Locally Testable Languages (Q5164867) (← links)
- A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* (Q5164869) (← links)
- On deterministic ordered restart-delete automata (Q5919676) (← links)