No CrossRef data available.
Published online by Cambridge University Press: 15 November 2003
We describe the communicating alternating machines and theirsimulation. We show that, in the case of communicating alternatingmachines which are bounded, simultaneously, by polynomial time andlogarithmic space, the use of three communication levels insteadof two does not increase computational power of communicatingalternating machines. This resolves an open problem [2]concerning the exact position of machines with three communicationlevels in the hierarchy.