Probabilistic game automata
type: Item
instance of: scholarly article
title: Probabilistic game automata
zbMATH Open document ID: 0682.68072
DOI: 10.1016/0022-0000(88)90038-4
author: Anne Condon
author: Richard E. Ladner
published in: Journal of Computer and System Sciences
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68U20
zbMATH DE Number: 4117875
zbMATH Keywords: alternating Turing machines
zbMATH Keywords: probabilistic game automaton
zbMATH Keywords: two-person game
zbMATH Keywords: games against unknown nature
MaRDI profile type: Publication
full work available at URL: 0022-0000(88)90038-4
OpenAlex ID: W186014684
cites work: Q5833225
cites work: The complexity of logical theories
cites work: Alternation
cites work: Computational Complexity of Probabilistic Turing Machines
cites work: The knowledge complexity of interactive proof-systems
cites work: Finite Continuous Time Markov Chains
cites work: Q3050157
cites work: Solitaire automata
cites work: The complexity of two-player games of incomplete information
description: scientific article; zbMATH DE number 4117875