P. Balbiani, O. Gasquet, and F. Schwarzentruber, Epistemic reasoning in Lineland, Communication presented during Advances in Modal Logic, 2010.

A. Baltag and L. Moss, Logics for epistemic programs, Synthese, pp.165-224, 2004.

M. Ben-or, D. Kozen, and J. Reif, The complexity of elementary algebra and geometry, Journal of Computer and System Sciences, vol.32, issue.2, pp.251-264, 1986.
DOI : 10.1016/0022-0000(86)90029-2

P. Blackburn, M. De-rijke, and Y. Venema, Modal Logic, 2001.
DOI : 10.1017/CBO9781107050884
URL : https://hal.archives-ouvertes.fr/inria-00100502

J. Canny, Some algebraic and geometric computations in P SP ACE, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp.460-467, 1988.

A. Chandra, D. Kozen, and L. Stockmeyer, Alternation, Journal of the ACM, vol.28, issue.1, pp.114-133, 1981.
DOI : 10.1145/322234.322243

S. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

J. Halpern and Y. Moses, Knowledge and common knowledge in a distributed environment, Journal of the ACM, vol.37, issue.3, pp.549-587, 1990.
DOI : 10.1145/79147.79161

R. Ladner, The Computational Complexity of Provability in Systems of Modal Propositional Logic, SIAM Journal on Computing, vol.6, issue.3, pp.467-480, 1977.
DOI : 10.1137/0206033

R. Parikh, L. Moss, and C. Steinsvold, Topology and Epistemic Logic, pp.299-341, 2007.
DOI : 10.1007/978-1-4020-5587-4_6

J. Renegar, A faster P SP ACE algorithm for deciding the existential theory of the reals, Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pp.291-295, 1988.

W. Savitch, Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, vol.4, issue.2, pp.177-192, 1970.
DOI : 10.1016/S0022-0000(70)80006-X

F. Schwarzentruber, Knowledge about lights along a line, Communication presented during The Eighth, International Conference on Autonomous Agents and Multiagent Systems, 2009.

F. Schwarzentruber, . Seeing, and . Knowing, Doing: Case Studies in Modal Logic, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00609903

K. Sim, Epistemic logic and logical omniscience: A survey, International Journal of Intelligent Systems, vol.12, issue.1, pp.57-81, 1997.
DOI : 10.1002/(SICI)1098-111X(199701)12:1<57::AID-INT3>3.0.CO;2-X

K. Sim, Epistemic logic and logical omniscience II: A unifying framework, International Journal of Intelligent Systems, vol.18, issue.2, pp.129-152, 2000.
DOI : 10.1002/(SICI)1098-111X(200002)15:2<129::AID-INT3>3.0.CO;2-T

L. Stockmeyer, The polynomial-time hierarchy, Theoretical Computer Science, vol.3, issue.1, pp.1-22, 1977.
DOI : 10.1016/0304-3975(76)90061-X

P. Annex and . Lemma, The argument is similar to that given in