Solitaire automata

DOI10.1016/0022-0000(85)90007-8zbMath0564.90108OpenAlexW4210422112MaRDI QIDQ1058475

Jeffrey K. Norman, Richard E. Ladner

Publication date: 1985

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(85)90007-8

zbMATH Keywords

Turing machinesimperfect informationsolitaire gamessolitaire automatonspace and time bounds

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Game theory (91A99) Formal languages and automata (68Q45) Turing machines and related notions (03D10)

Related Items

Classifying the computational complexity of problems, Turing machines with access to history, Probabilistic game automata, Decision algorithms for multiplayer noncooperative games of incomplete information

Cites Work

• The complexity of two-player games of incomplete information
• Provably Difficult Combinatorial Games
• Alternation
• The NP-completeness column: An ongoing guide