Includes supplementary material: sn.pub/extras
Maurice Margenstern
Erfüllbarkeitsproblem der Aussagenlogik Monoid P systems algorithms automata cellular automata complexity formal language logic natural computing ramdomness theoretical computer science theory of computing turing machines universality