From domino tilings to a new model of computation

  • Bogdan S. Chlebus
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 208)


A new model of computation called VH-system is introduced. It is a formalization of domino tilings. We show how the semantics of nondeterminism on VH-systems, being a natural counterpart of the machinery of tilings, can be modified to cover both deterministic and alternating computations. As a by-product we present a new proof of the fact that the satisfiability problem of boolean Horn formulas is complete in PTIME.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CKS]
    Chandra, A.K., D.C. Kozen, and L.J. Stockmeyer, Alternation, J. ACM 28 (1981) 114–133.Google Scholar
  2. [C1]
    Chlebus, B.S., Domino-tiling games, submitted to J. Comput. Syst. Sci.Google Scholar
  3. [C2]
    Chlebus, B.S., Subclasses of boolean formulas and their satisfiability problems, to appear.Google Scholar
  4. [E]
    van Emde Boas, P., Dominoes are forever, 1-st GTI Workshop, Paderborn, 75–95, 1983.Google Scholar
  5. [GJ]
    Garey, M.R., and D.S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", H. Freeman, San Francisco, 1979.Google Scholar
  6. [H1]
    Harel, D., A simple highly undecidable domino problem (or, a lemma on infinite trees, with applications), Proc. Logic and Computation Conference, Clayton, Victoria, Australia, 1984.Google Scholar
  7. [H2]
    Harel, D., Recurring dominoes: making the highly undecidable highly understandable, in M. Karpinski (ed.), Foundations of Computing Theory, Proc. 1983 FCT Conf. Borgholm Sweden, Springer LNCS 158 (1983) 177–194; also to appear in Annals of Discrete Math.Google Scholar
  8. [HU]
    Hopcroft, J.E., and J.D. Ullman, "Introduction to Automata Theory, Languages and Computation", Addison-Wesley, Reading, MA, 1979.Google Scholar
  9. [JL]
    Jones, N.D., and W.T. Laaser, Complete problems for deterministic polynomial time, Theor. Comput. Sci. 3 (1976) 105–117.Google Scholar
  10. [L]
    Levin, L.A., Universal sequential search problems, (translation), Problems in Information Transmission 9 (1973) 265–266.Google Scholar
  11. [Lw1]
    Lewis, H.R., Complexity of solvable cases of the decision problem for the predicate calculus, 19th FOCS, 35–47, 1978.Google Scholar
  12. [Lw2]
    Lewis, H.R., "Unsolvable Classes of Quantificational Formulas", Addison-Wesley, Reading, 1979.Google Scholar
  13. [LP]
    Lewis, H.R., and C.H. Papadimitriou, "Elements of the Theory of Computation", Prentice-Hall, 1981.Google Scholar
  14. [SE]
    Savelsberg, M.P.W., and P. van Emde Boas, BOUNDED TILING, an alternative to SATISFIABILITY?, in G. Wechsung ed. Proc. 2nd Frege Conference, Schwerin 1984, Akademie Verlag, Mathematische Forschung 20 (1984) 354–363.Google Scholar
  15. [S]
    Stockmeyer, L.J., The polynomial-time hierarchy, Theor. Comput. Sci. 3 (1976) 1–22.Google Scholar
  16. [W]
    Wang, H., Proving theorems by pattern recognition II, Bell System Tech. J. 40 (1961) 1–4.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Bogdan S. Chlebus
    • 1
  1. 1.Institute of InformaticsWarsaw University PKiN VIIIpWarsawPoland

Personalised recommendations