Hendrik Jan Hoogeboom
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hendrik Jan Hoogeboom has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Robert Brijder
M&CS Department, Eindhoven University of Technology
28 shared publications Joost Engelfriet
11 shared publicationsGrzegorz Rozenberg
Leiden University
7 shared publicationsG. Rozenberg
University of Leiden
6 shared publicationsA. Ehrenfeucht
University of Colorado at Boulder
4 shared publications- Linqiang Pan
Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China, School of Artificial Intelligence and Automation, Huazhong University of Science and Technology, Wuhan, China
4 shared publications
Latest Publications
- 1 January 2021
- Published by Elsevier in Theoretical Computer Science
- Vol. 850, 40-97
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- 1 January 2021
- Published by Elsevier in Theoretical Computer Science
- Vol. 850, 40-97
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- 1 October 2020
- Published by Elsevier in European Journal of Combinatorics
- Vol. 89
Counterexamples to a conjecture of Las Vergnas
- 1 October 2020
- Published by Elsevier in European Journal of Combinatorics
- Vol. 89
Counterexamples to a conjecture of Las Vergnas
- 1 September 2020
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 2 (3) , 194-206
Extracting reaction systems from function behavior
- 1 September 2020
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 2 (3) , 194-206
Extracting reaction systems from function behavior
- 1 November 2017
- Published by Elsevier in Theoretical Computer Science
- Vol. 701, 109-119
A graph isomorphism condition and equivalence of reaction systems
- 1 November 2017
- Published by Elsevier in Theoretical Computer Science
- Vol. 701, 109-119
A graph isomorphism condition and equivalence of reaction systems
- 9 August 2017
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 154 (1-4) , 131-144
Enforcing Regular Languages
We investigate regular languages in the context of the forbidding-enforcing systems introduced by Ehrenfeucht and Rozenberg in the variant where one fe-system defines a single language. In general, these systems may have infinite sets of rules, allow
- 9 August 2017
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 154 (1-4) , 131-144
Enforcing Regular Languages
We investigate regular languages in the context of the forbidding-enforcing systems introduced by Ehrenfeucht and Rozenberg in the variant where one fe-system defines a single language. In general, these systems may have infinite sets of rules, allow
- 12 May 2017
- Published by Springer Nature
- p. 258-269
Finite Language Forbidding-Enforcing Systems
- 1 August 2014
- Published by Elsevier in European Journal of Combinatorics
- Vol. 40, 142-167
Interlace polynomials for multimatroids and delta-matroids
- 1 August 2014
- Published by Elsevier in European Journal of Combinatorics
- Vol. 40, 142-167
Interlace polynomials for multimatroids and delta-matroids
- Open Access
Quaternary matroids are vf-safe
Binary delta-matroids are closed under vertex flips, which consist of the natural operations of twist and loop complementation. In this note we provide an extension of this result from GF(2) to GF(4). As a consequence, quaternary matroids are "safe" under vertex flips (vf-safe for short). As an application, we find that the matroid of a bicycle space of a quaternary matroid is independent of the chosen representation. This extends a result of Vertigan [J. Comb. Theory B (1998)] concerning the bicycle dimension of quaternary matroids.
Open AccessQuaternary matroids are vf-safe
Binary delta-matroids are closed under vertex flips, which consist of the natural operations of twist and loop complementation. In this note we provide an extension of this result from GF(2) to GF(4). As a consequence, quaternary matroids are "safe" under vertex flips (vf-safe for short). As an application, we find that the matroid of a bicycle space of a quaternary matroid is independent of the chosen representation. This extends a result of Vertigan [J. Comb. Theory B (1998)] concerning the bicycle dimension of quaternary matroids.
- 1 March 2014
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 37 (1) , 3-16
Acyclic Constraint Logic and Games
H.j.hoogeboom@liacs.leidenuniv.nl w.a.kosters@liacs.leidenuniv.nl j.n.van.rijn@liacs.leidenuniv.nl j.k.vis@liacs.leidenuniv.nl Non-deterministic Constraint Logic is a family of graph games introduced by Demaine and Hearn that facilitates the construc
- 1 March 2014
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 37 (1) , 3-16
Acyclic Constraint Logic and Games
H.j.hoogeboom@liacs.leidenuniv.nl w.a.kosters@liacs.leidenuniv.nl j.n.van.rijn@liacs.leidenuniv.nl j.k.vis@liacs.leidenuniv.nl Non-deterministic Constraint Logic is a family of graph games introduced by Demaine and Hearn that facilitates the construc
- 1 January 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 63-72
Graph Polynomials Motivated by Gene Rearrangements in Ciliates
- 1 January 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 63-72
Graph Polynomials Motivated by Gene Rearrangements in Ciliates