Abstract

We consider domino games which describe computations of alternating Turing machines in the same way as dominoes (tiling systems) encode computations of deterministic and nondeterministic Turing machines. The domino games are two person games in the course of which the players build up domino-tilings of a square of prescribed size. Acceptance of an alternating Turing machine corresponds to a winning strategy for one player — the number of moves in the game is the number of alternations of the Turing machine.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call