Pages that link to "Item:Q5626625"
From MaRDI portal
The following pages link to Characterizations of Pushdown Machines in Terms of Time-Bounded Computers (Q5626625):
Displaying 4 items.
- Two-way nested stack automata are equivalent to two-way stack automata (Q1227452) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- A Practical Simulation Result for Two-Way Pushdown Automata (Q2830212) (← links)
