Turing machines with access to history
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3976339 (Why is no real title available?)
- scientific article; zbMATH DE number 4039295 (Why is no real title available?)
- scientific article; zbMATH DE number 4061218 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3727583 (Why is no real title available?)
- scientific article; zbMATH DE number 3894472 (Why is no real title available?)
- N by N Checkers is Exptime Complete
- Alternation
- Alternation with restrictions on looping
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Domino-tiling games
- GO Is Polynomial-Space Hard
- Solitaire automata
- The complexity of two-player games of incomplete information
- Writing pushdown acceptors
This page was built for publication: Turing machines with access to history
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751802)