On coordinated rewriting. - Andrzej Ehrenfeucht; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (FCT, 1985)

Infinitary Languages: Basic Theory an Applications to Concurrent Systems. - Hendrik Jan Hoogeboom; Grzegorz Rozenberg (Current Trends in Concurrency, 1986)

Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping. - Andrzej Ehrenfeucht; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (RAIRO Theor. Informatics Appl., 1986)

Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma. - Andrzej Ehrenfeucht; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (RAIRO Theor. Informatics Appl., 1986)

On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata. - Andrzej Ehrenfeucht; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (Theor. Comput. Sci., 1986)

Decision Problems for Regular Trace Languages. - IJsbrand Jan Aalbersberg; Hendrik Jan Hoogeboom (ICALP, 1987)

Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata. - Andrzej Ehrenfeucht; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (Acta Informatica, 1988)

Prefix and Equality Languages of Rational Functions are Co-Context-Free. - Joost Engelfriet; Hendrik Jan Hoogeboom (Inf. Process. Lett., 1988)

Automata with Storage on Infinite Words. - Joost Engelfriet; Hendrik Jan Hoogeboom (ICALP, 1989)

Characterizations of the Decidability of Some Problems for Regular Trace Languages. - IJsbrand Jan Aalbersberg; Hendrik Jan Hoogeboom (Math. Syst. Theory, 1989)

Diamond properties of elementary net systems. - Hendrik Jan Hoogeboom; Grzegorz Rozenberg (Fundam. Informaticae, 1991)

An Introduction to Context-free Text Grammars. - Andrzej Ehrenfeucht; Hendrik Jan Hoogeboom; Paulien ten Pas; Grzegorz Rozenberg (Developments in Language Theory, 1993)

On the Structure of Recognizable Languages of Dependence Graphs. - Andrzej Ehrenfeucht; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (RAIRO Theor. Informatics Appl., 1993)

X-Automata on omega-Words. - Joost Engelfriet; Hendrik Jan Hoogeboom (Theor. Comput. Sci., 1993)

Identities and Transductions. - Tero Harju; Hendrik Jan Hoogeboom; H. C. M. Kleijn (Results and Trends in Theoretical Computer Science, 1994)

MSO Definable Text Languages. - Hendrik Jan Hoogeboom; Paulien ten Pas (MFCS, 1994)

Combinatorial Properties of Dependence Graphs - Andrzej Ehrenfeucht; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (Inf. Comput., 1994)

Dependence Graphs. - Hendrik Jan Hoogeboom; Grzegorz Rozenberg (The Book of Traces, 1995)

Text Languages in an Algebraic Framework. - Hendrik Jan Hoogeboom; Paulien ten Pas (Fundam. Informaticae, 1996)

Monadic Second-Order Definable Text Languages. - Hendrik Jan Hoogeboom; Paulien ten Pas (Theory Comput. Syst., 1997)

The Code Problem for Traces - Improving the Boundaries. - Hendrik Jan Hoogeboom; Anca Muscholl (Theor. Comput. Sci., 1997)

Tree-Walking Pebble Automata. - Joost Engelfriet; Hendrik Jan Hoogeboom (Jewels are Forever, 1999)

Forbidding and enforcing. - Andrzej Ehrenfeucht; Hendrik Jan Hoogeboom; Grzegorz Rozenberg; Nike van Vugt (DNA Based Computers, 1999)

Two-Way Finite State Transducers and Monadic Second-Order Logic. - Joost Engelfriet; Hendrik Jan Hoogeboom (ICALP, 1999)

Trips on Trees. - Joost Engelfriet; Hendrik Jan Hoogeboom; Jan-Pascal van Best (Acta Cybern., 1999)

Fair sticker languages. - Hendrik Jan Hoogeboom; Nike van Vugt (Acta Informatica, 2000)

A characterization of non-iterated splicing with regular rules. - Ray Dassen; Hendrik Jan Hoogeboom; Nike van Vugt (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

Context-Free Valence Grammars - Revisited. - Hendrik Jan Hoogeboom (Developments in Language Theory, 2001)

Sequences of languages in forbidding-enforcing families. - Andrzej Ehrenfeucht; Hendrik Jan Hoogeboom; Grzegorz Rozenberg; Nike van Vugt (Soft Comput., 2001)

MSO definable string transductions and two-way finite-state transducers. - Joost Engelfriet; Hendrik Jan Hoogeboom (ACM Trans. Comput. Log., 2001)

Upper Bounds for Restricted Splicing. - Hendrik Jan Hoogeboom; Nike van Vugt (Formal and Natural Computing, 2002)

Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata. - Hendrik Jan Hoogeboom (Developments in Language Theory, 2002)

Simulating Counter Automata by P Systems with Symport/Antiport. - Pierluigi Frisco; Hendrik Jan Hoogeboom (WMC-CdeA, 2002)

A Direct Construction of a Universal P System. - Pierluigi Frisco; Hendrik Jan Hoogeboom; Paul Sant (Fundam. Informaticae, 2002)

Languages Defined by Generalized Equality Sets. - Vesa Halava; Tero Harju; Hendrik Jan Hoogeboom; Michel Latteux (FCT, 2003)

Combinatorial Aspects of Minimal DNA Expressions. - Rudy van Vliet; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (DNA, 2004)

P systems with symport/antiport simulating counter automata. - Pierluigi Frisco; Hendrik Jan Hoogeboom (Acta Informatica, 2004)

Tetris is hard, even to approximate. - Ron Breukelaar; Erik D. Demaine; Susan Hohenberger; Hendrik Jan Hoogeboom; Walter A. Kosters; David Liben-Nowell (Int. J. Comput. Geom. Appl., 2004)

How to Construct Tetris Configurations. - Hendrik Jan Hoogeboom; Walter A. Kosters (Int. J. Intell. Games Simul., 2004)

Tetris and decidability. - Hendrik Jan Hoogeboom; Walter A. Kosters (Inf. Process. Lett., 2004)

Valence Languages Generated by Equality Sets. - Vesa Halava; Tero Harju; Hendrik Jan Hoogeboom; Michel Latteux (J. Autom. Lang. Comb., 2004)

The Breakpoint Graph in Ciliates. - Robert Brijder; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (CompLife, 2005)

Equality sets for recursively enumerable languages. - Vesa Halava; Tero Harju; Hendrik Jan Hoogeboom; Michel Latteux (RAIRO Theor. Informatics Appl., 2005)

Applicability of Loop Recombination in Ciliates Using the Breakpoint Graph. - Robert Brijder; Hendrik Jan Hoogeboom; Michael Muskulus (CompLife, 2006)

Computing by Only Observing. - Matteo Cavaliere; Pierluigi Frisco; Hendrik Jan Hoogeboom (Developments in Language Theory, 2006)

Nested Pebbles and Transitive Closure. - Joost Engelfriet; Hendrik Jan Hoogeboom (STACS, 2006)

The Construction of Minimal DNA Expressions. - Rudy van Vliet; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (Nat. Comput., 2006)

Reducibility of gene patterns in ciliates using the breakpoint graph. - Robert Brijder; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (Theor. Comput. Sci., 2006)

Characterizing Reduction Graphs for Gene Assembly in Ciliates. - Robert Brijder; Hendrik Jan Hoogeboom (Developments in Language Theory, 2007)

From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates. - Robert Brijder; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (FCT, 2007)

High Spies (or How to Win a Programming Contest). - André H. Deutz; Rudy van Vliet; Hendrik Jan Hoogeboom (FUN, 2007)

XML transformation by tree-walking transducers with invisible pebbles. - Joost Engelfriet; Hendrik Jan Hoogeboom; Bart Samwel (PODS, 2007)

How Overlap Determines the Macronuclear Genes in Ciliates - Robert Brijder; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (CoRR, 2007)

Finitary Compositions of Two-way Finite-State Transductions. - Joost Engelfriet; Hendrik Jan Hoogeboom (Fundam. Informaticae, 2007)

P Systems with Single passenger Carriers. - Yan Gao; Hendrik Jan Hoogeboom (Int. J. Found. Comput. Sci., 2007)

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure. - Joost Engelfriet; Hendrik Jan Hoogeboom (Log. Methods Comput. Sci., 2007)

Extending the Overlap Graph for Gene Assembly in Ciliates. - Robert Brijder; Hendrik Jan Hoogeboom (LATA, 2008)

The fibers and range of reduction graphs in ciliates. - Robert Brijder; Hendrik Jan Hoogeboom (Acta Informatica, 2008)

Strategies of loop recombination in ciliates. - Robert Brijder; Hendrik Jan Hoogeboom; Michael Muskulus (Discret. Appl. Math., 2008)

Selection of DNA Markers. - Hendrik Jan Hoogeboom; Walter A. Kosters; Jeroen F. J. Laros (IEEE Trans. Syst. Man Cybern. Part C, 2008)

Reality-and-Desire in Ciliates. - Robert Brijder; Hendrik Jan Hoogeboom (Algorithmic Bioprocesses, 2009)

Automata Walking over Trees and Graphs. - Hendrik Jan Hoogeboom (NCMA, 2009)

Nullity Invariance for Pivot and the Interlace Polynomial - Robert Brijder; Hendrik Jan Hoogeboom (CoRR, 2009)

Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates. - Robert Brijder; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (Int. J. Found. Comput. Sci., 2009)

Perfectly quilted rectangular snake tilings. - Robert Brijder; Hendrik Jan Hoogeboom (Theor. Comput. Sci., 2009)

Spiking Neural P Systems with Neuron Division. - Jun Wang 014; Hendrik Jan Hoogeboom; Linqiang Pan (Int. Conf. on Membrane Computing, 2010)

Pivot and Loop Complementation on Graphs and Set Systems. - Robert Brijder; Hendrik Jan Hoogeboom (TAMC, 2010)

Maximal pivots on graphs with an application to gene assembly. - Robert Brijder; Hendrik Jan Hoogeboom (Discret. Appl. Math., 2010)

Spiking Neural P Systems with Weights. - Jun Wang 014; Hendrik Jan Hoogeboom; Linqiang Pan; Gheorghe Paun; Mario J. Pérez-Jiménez (Neural Comput., 2010)

Combining overlap and containment for gene assembly in ciliates. - Robert Brijder; Hendrik Jan Hoogeboom (Theor. Comput. Sci., 2010)

Asynchronous Extended Spiking Neural P Systems with Astrocytes. - Linqiang Pan; Jun Wang 014; Hendrik Jan Hoogeboom (Int. Conf. on Membrane Computing, 2011)

The group structure of pivot and loop complementation on graphs and set systems. - Robert Brijder; Hendrik Jan Hoogeboom (Eur. J. Comb., 2011)

Limited Asynchronous Spiking Neural P Systems. - Linqiang Pan; Jun Wang 014; Hendrik Jan Hoogeboom (Fundam. Informaticae, 2011)

P Systems and Topology: Some Suggestions for Research. - Pierluigi Frisco; Hendrik Jan Hoogeboom (Int. J. Found. Comput. Sci., 2011)

On aggregation in multiset-based self-assembly of graphs. - Francesco Bernardini; Robert Brijder; Matteo Cavaliere; Giuditta Franco; Hendrik Jan Hoogeboom; Grzegorz Rozenberg (Nat. Comput., 2011)

Binary Symmetric Matrix Inversion Through Local Complementation. - Robert Brijder; Hendrik Jan Hoogeboom (Fundam. Informaticae, 2012)

Spiking Neural P Systems with Astrocytes. - Linqiang Pan; Jun Wang 014; Hendrik Jan Hoogeboom (Neural Comput., 2012)

Preface. - Giorgio Ausiello; Hendrik Jan Hoogeboom; Juhani Karhumäki; Ion Petre; Arto Salomaa (Theor. Comput. Sci., 2012)

Pivots, determinants, and perfect matchings of graphs. - Robert Brijder; Tero Harju; Hendrik Jan Hoogeboom (Theor. Comput. Sci., 2012)

The Adjacency Matroid of a Graph. - Lorenzo Traldi; Robert Brijder; Hendrik Jan Hoogeboom (Electron. J. Comb., 2013)

Making DNA Expressions Minimal. - Rudy van Vliet; Hendrik Jan Hoogeboom (Fundam. Informaticae, 2013)

A Minimal Normal Form for DNA Expressions. - Rudy van Vliet; Hendrik Jan Hoogeboom (Fundam. Informaticae, 2013)

Nullity and Loop Complementation for Delta-Matroids. - Robert Brijder; Hendrik Jan Hoogeboom (SIAM J. Discret. Math., 2013)

Graph Polynomials Motivated by Gene Rearrangements in Ciliates. - Robert Brijder; Hendrik Jan Hoogeboom (CiE, 2014)

Interlace polynomials for multimatroids and delta-matroids. - Robert Brijder; Hendrik Jan Hoogeboom (Eur. J. Comb., 2014)

Acyclic Constraint Logic and Games. - Hendrik Jan Hoogeboom; Walter A. Kosters; Jan N. van Rijn; Jonathan K. Vis (J. Int. Comput. Games Assoc., 2014)

The Algebra of Gene Assembly in Ciliates. - Robert Brijder; Hendrik Jan Hoogeboom (Discrete and Topological Models in Molecular Biology, 2014)

Finite Language Forbidding-Enforcing Systems. - Daniela Genova; Hendrik Jan Hoogeboom (CiE, 2017)

Enforcing Regular Languages. - Daniela Genova; Hendrik Jan Hoogeboom (Fundam. Informaticae, 2017)

A graph isomorphism condition and equivalence of reaction systems. - Daniela Genova; Hendrik Jan Hoogeboom; Natasa Jonoska (Theor. Comput. Sci., 2017)

Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute. - Jérôme Durand-Lose; Hendrik Jan Hoogeboom; Natasa Jonoska (CoRR, 2019)

Counterexamples to a conjecture of Las Vergnas. - Robert Brijder; Hendrik Jan Hoogeboom (Eur. J. Comb., 2020)

Companions and an Essential Motion of a Reaction System. - Daniela Genova; Hendrik Jan Hoogeboom; Natasa Jonoska (Fundam. Informaticae, 2020)

Extracting reaction systems from function behavior. - Daniela Genova; Hendrik Jan Hoogeboom; Zornitza Genova Prodanoff (J. Membr. Comput., 2020)

XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles. - Joost Engelfriet; Hendrik Jan Hoogeboom; Bart Samwel (Theor. Comput. Sci., 2021)

Comparing reactions in reaction systems. - Daniela Genova; Hendrik Jan Hoogeboom; Jetty Kleijn (Theor. Comput. Sci., 2021)

Deterministic Non-cooperative Binding in Two-Dimensional Tile Assembly Systems Must Have Ultimately Periodic Paths. - Jérôme Durand-Lose; Hendrik Jan Hoogeboom; Natasa Jonoska (CoRR, 2022)

Functional equivalence and a cover relation for reaction systems. - Daniela Genova; Hendrik Jan Hoogeboom; Jetty Kleijn (Theor. Comput. Sci., 2024)