@inproceedings{e3752493603442618945330e400061f1,

title = "From domino tilings to a new model of computation",

abstract = "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.",

author = "Chlebus, {Bogdan S.}",

year = "1985",

month = jan,

day = "1",

doi = "10.1007/3-540-16066-3_4",

language = "English (US)",

isbn = "9783540160663",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "24--33",

editor = "Andrzej Skowron",

booktitle = "Computation Theory - 5th Symposium, Proceedings",

note = "5th Symposium on Computation Theory, SCT 1984 ; Conference date: 03-12-1984 Through 08-12-1984",

}