H
Hendrik Jan Hoogeboom
Researcher at Leiden University
Publications - 112
Citations - 1711
Hendrik Jan Hoogeboom is an academic researcher from Leiden University. The author has contributed to research in topics: Matroid & Tutte polynomial. The author has an hindex of 18, co-authored 111 publications receiving 1597 citations. Previous affiliations of Hendrik Jan Hoogeboom include University of Colorado Boulder.
Papers
More filters
Journal ArticleDOI
MSO definable string transductions and two-way finite-state transducers
TL;DR: It is shown that both classes of MSO definable string transductions are characterized in terms of Hennie machines, i.e., two-way finite-state transducers that are allowed to rewrite their input tape, but may visit each position of their input only a bounded number of times.
Journal ArticleDOI
Tetris is hard, even to approximate
Ron Breukelaar,Erik D. Demaine,Susan Hohenberger,Hendrik Jan Hoogeboom,Walter A. Kosters,David Liben-Nowell +5 more
TL;DR: In this article, it was shown that in the offline version of the game, it is -complete to maximize the number of cleared rows, minimize the maximum height of an occupied square, or maximize the total number of pieces placed before the game ends.
Journal ArticleDOI
Spiking neural p systems with weights
TL;DR: It is proved that integers suffice for computing all Turing computable sets of numbers in both the generative and the accepting modes and a characterization of the family of semilinear sets ofNumbers is obtained.
Journal ArticleDOI
Spiking neural p systems with astrocytes
TL;DR: It is proved that SNPA systems with simple neurons are Turing universal in both generative and accepting modes, and if a bound is given on the number of spikes present in any neuron along a computation, then the computation power ofSNPA systems is diminished.
Journal ArticleDOI
X-automata on Ω-words
TL;DR: The main tools for this investigation are a characterization of the ω-languages accepted by X -automata in terms of inverse X -transductions of finite-state ω -languages and the existence of topological upper bounds on some of the families of accepted υ-l languages (independent of the storage type X).