Pages that link to "Item:Q5401559"
From MaRDI portal
The following pages link to ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA (Q5401559):
Displaying 5 items.
- Non-recursive trade-offs between two-dimensional automata and grammars (Q896688) (← links)
- Deleting deterministic restarting automata with two windows (Q2408809) (← links)
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714) (← links)
- On restarting automata with auxiliary symbols and small window size (Q5021113) (← links)
- Decidability Questions for Insertion Systems and Related Models (Q5164868) (← links)