From domino tilings to a new model of computation

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationComputation Theory - 5th Symposium, Proceedings
EditorsAndrzej Skowron
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540160663
StatePublished - Jan 1 1985
Externally publishedYes
Event5th Symposium on Computation Theory, SCT 1984 - Zaborow, Poland
Duration: Dec 3 1984Dec 8 1984

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume208 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th Symposium on Computation Theory, SCT 1984

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'From domino tilings to a new model of computation'. Together they form a unique fingerprint.

Cite this