Hendrik Jan Hoogeboom at the DBLP Bibliography Server

J. Engelfriet, H.J. Hoogeboom, B. Samwel.

XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles.
Theoretical Computer Science 850 (2021) 40-97.
doi:10.1016/j.tcs.2020.10.030
arXiv: 1809.05730 .

R. Brijder, H.J. Hoogeboom.

Counterexamples to a conjecture of Las Vergnas.
European Journal of Combinatorics 89 (October 2020) 103141.
doi:10.1016/j.ejc.2020.103141
arXiv: 1809.00813 .

D. Genova, H.J. Hoogeboom, N. Jonoska.

Companions and an Essential Motion of a Reaction System.
Fundamenta Informaticae 175 (2020) 187-199.
doi:10.3233/FI-2020-1953

D. Genova, H.J. Hoogeboom, J. Kleijn.

Comparing Reactions in Reaction Systems.
Theoretical Computer Science (2020) in press.
doi:10.1016/j.tcs.2020.11.050

D. Genova, H.J. Hoogeboom, Z. Prodonoff.

Extracting Reaction Systems from Function Behavior.
Journal of Membrane Computing 2 (2020) 194-206.
doi:10.1007/s41965-020-00045-z

R. Brijder, H.J. Hoogeboom, N. Jonoska, M. Saito.

Graphs Associated With DNA Rearrangements and Their Polynomials.
In: Algebraic and Combinatorial Computational Biology (R. Robeva, M. Macauley, eds.), Academic Press, 61-87, 2019.
doi:10.1016/B978-0-12-814066-6.00003-9

J. Durand-Lose, H.J. Hoogeboom, N. Jonoska.

Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute.
Under revision, Jan 2019.
arXiv: 1901.08575 .

D. Genova, H.J. Hoogeboom.

Finite Language Forbidding-Enforcing Systems.
In: Computability in Europe (CiE 2017) Turku, Lecture Notes in Computer Science, v. 10307, 258-269, 2017.
doi:10.1007/978-3-319-58741-7_25

D. Genova, H.J. Hoogeboom.

Enforcing Regular Languages.
Fundamenta Informaticae 154 (2017) 131-144.
doi:10.3233/FI-2017-1556

D. Genova, H.J. Hoogeboom, N. Jonoska.

A Graph Isomorphism Condition and Equivalence of Reaction Systems.
Theoretical Computer Science 701 (2017) 109-119.
doi:10.1016/j.tcs.2017.05.019
arXiv: 1701.01895 .

R. Brijder, H.J. Hoogeboom.

Interlace Polynomials for Multimatroids and Delta-Matroids.
European Journal of Combinatorics 40 (2014) 142-167.
doi:10.1016/j.ejc.2014.03.005
arXiv: 1010.4678 . MathSciNet .

R. Brijder, H.J. Hoogeboom.

The Algebra of Gene Assembly in Ciliates.
In: Discrete and Topological Models in Molecular Biology (N. Jonoska, M. Saito, eds.), Natural Computing Series, Springer Berlin Heidelberg, 289-307, 2014.
doi:10.1007/978-3-642-40193-0_13

R. Brijder, H.J. Hoogeboom.

Graph Polynomials Motivated by Gene Rearrangements in Ciliates.
In: Language, Life, Limits, 10th Conference on Computability in Europe (CiE 2014) (A. Beckmann, E. Csuhaj-Varjú, K. Meer, eds.), Lecture Notes in Computer Science, v. 8493, 63-72, 2014.
doi:10.1007/978-3-319-08019-2_7

R. Brijder, H.J. Hoogeboom.

The Interlace Polynomial and the Tutte-Martin Polynomial.
2014.
Submitted for the CRC Handbook on the Tutte Polynomial edited by J. Ellis-Monaghan and I. Moffatt . pdf .

H.J. Hoogeboom, W.A. Kosters, J.N. van Rijn, J.K. Vis.

Acyclic Constraint Logic and Games.
ICGA Journal 37 (2014) 3-16.
doi:10.3233/ICG-2014-37102
arXiv: 1604.05487 .

R. Brijder, H.J. Hoogeboom.

Nullity and Loop Complementation for Delta-Matroids.
SIAM Journal on Discrete Mathematics 27 (2013) 492-506.
doi:10.1137/110854692
arXiv: 1010.4497 .

R. Brijder, H.J. Hoogeboom.

Quaternary matroids are vf-safe / Quaternary Bicycle Matroids and the Penrose Polynomial for Delta-Matroids.
preprint, 2013.
arXiv: 1302.4415 . arXiv: 1210.7718 .

L. Traldi, R. Brijder, H.J. Hoogeboom.

The Adjacency Matroid of a Graph.
The Electronic Journal of Combinatorics 20 (3) (2013) P27.
38 pages . MathSciNet .

R. van Vliet, H.J. Hoogeboom.

Making DNA Expressions Minimal.
Fundamenta Informaticae 123 (2013) 199-226.
doi:10.3233/FI-2012-807

R. van Vliet, H.J. Hoogeboom.

A Minimal Normal Form for DNA Expressions.
Fundamenta Informaticae 123 (2013) 227-243.
doi:10.3233/FI-2012-808

G. Ausiello, H.J. Hoogeboom, J. Karhumäki, I. Petre, A. Salomaa (eds.).

Magic in Science. Theoretical Computer Science, volume 429, 20 April 2012.
doi:10.1016/j.tcs.2011.12.019
Volume .

R. Brijder, T. Harju, H.J. Hoogeboom.

Pivots, determinants, and perfect matchings of graphs.
Theoretical Computer Science 454 (2012) 64-71.
doi:10.1016/j.tcs.2012.02.031

R. Brijder, H.J. Hoogeboom.

Binary Symmetric Matrix Inversion Through Local Complementation.
Fundamenta Informaticae 116 (2012) 15-23.
MathSciNet .

L. Pan, Jun Wang, H.J. Hoogeboom.

Asynchronous extended spiking neural P systems with Astrocytes.
In: Membrane Computing, 12th International Conference (CMC 2011) (M. Gheorghe, G. Paun, G. Rozenberg, A. Salomaa, S. Verlan, Springer Verlag, eds.), Lecture Notes in Computer Science, v. 7184, 243-246, 2012.
doi:10.1007/978-3-642-28024-5_17

L. Pan, Jun Wang, H.J. Hoogeboom.

Spiking Neural P Systems with Astrocytes.
Neural Computation 24 (2012) 805-825.
doi:10.1162/NECO_a_00238

F. Bernardini, R. Brijder, M. Cavaliere, G. Franco, H.J. Hoogeboom, G. Rozenberg.

On aggregation in multiset-based self-assembly of graphs.
Natural Computing 10 (2011) 17-38.
doi:10.1007/s11047-010-9183-3
MathSciNet .

R. Brijder, H.J. Hoogeboom.

Nullity Invariance for Pivot and the Interlace Polynomial.
Linear Algebra and its Applications 435 (2011) 277-288.
doi:10.1016/j.laa.2011.01.024
arXiv:0912.0878 . MathSciNet .

R. Brijder, H.J. Hoogeboom.

The Group Structure of Pivot and Loop Complementation on Graphs and Set Systems.
European Journal of Combinatorics 32 (2011) 1353-1367.
doi:10.1016/j.ejc.2011.03.002
arXiv:0909.4004 . MathSciNet .

P. Frisco, H.J. Hoogeboom.

P systems and topology: some suggestions for research.
International Journal of Foundations of Computer Science 22 (2011) 179-190.
MathSciNet .

L. Pan, Jun Wang, H.J. Hoogeboom.

Limited Asynchronous Spiking Neural P Systems.
Fundamenta Informaticae 110 (2011) 271-293.
doi:10.3233/FI-2011-543

M.P. Schraagen, H.J. Hoogeboom.

Predicting record linkage potential in a family reconstruction graph.
In: Proceedings of 23rd Benelux Conference on Artificial Intelligence (BNAIC 2011) (P. DeCausmaecker, ed.), 199-206, 2011.

R. Brijder, H.J. Hoogeboom.

Pivot and Loop Complementation on Graphs and Set Systems.
In: 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010) (J. Kratochvil, A. Li, eds.), Lecture Notes in Computer Science, v. 6108, 151-162, 2010.
doi:10.1007/978-3-642-13562-0_15
MathSciNet .

R. Brijder, H.J. Hoogeboom.

Maximal Pivots on Graphs with an Application to Gene Assembly.
Discrete Applied Mathematics 158 (2010) 1977-1985.
doi:10.1016/j.dam.2010.08.030
MathSciNet .

R. Brijder, H.J. Hoogeboom.

Combining Overlap and Containment for Gene Assembly in Ciliates.
Theoretical Computer Science 411 (2010) 897-905.
doi:10.1016/j.tcs.2009.07.047

J. Wang, H.J. Hoogeboom, L. Pan.

Spiking Neural P Systems with Neuron Division.
Membrane Computing, 11th International Conference (CMC 2010). Lecture Notes in Computer Science 6501 (2010) 361-376.
doi:10.1007/978-3-642-18123-8_28

J. Wang, H.J. Hoogeboom, L. Pan, G. Paun, A.J. Pérez-Jiménez.

Spiking Neural P Systems with Weights.
Neural Computation 22 (2010) 2615-2646.
doi:10.1162/NECO_a_00022

R. Brijder, H.J. Hoogeboom.

Perfectly Quilted Rectangular Snake Tilings.
Theoretical Computer Science 410 (2009) 1486-1494.
doi:10.1016/j.tcs.2008.12.010
Workshop on Tilings and Self-Assembly, Turku 2007 .

R. Brijder, H.J. Hoogeboom.

Reality-and-Desire in Ciliates.
In: Algorithmic Bioprocesses (A. Condon, D. Harel, J.N. Kok, A. Salomaa, E. Winfree, eds.), Natural Computing Series, 99-115, 2009.
doi:10.1007/978-3-540-88869-7_7
google books .

R. Brijder, H.J. Hoogeboom, G. Rozenberg.

Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates.
International Journal of Foundations of Computer Science 20 (2009) 271-291.
doi:10.1142/S0129054109006553

H.J. Hoogeboom.

Automata walking over trees and graphs.
In: Workshop on Non-Classical Models for Automata and Applications (NCMA) (H. Bordihn, R. Freund, M. Holzer, M. Kutrib, F. Otto, eds.), v. Band 256, Österreichische Computer Gesellschaft, Vienna, Austria, 11-14, September 2009.

J. Wang, H.J. Hoogeboom, L. Pan, Gh. Paun.

Spiking Neural P Systems with Weights and Thresholds.
In: Proceedings of the Tenth Workshop on Membrane Computing (WMC10) (G. Paun, M.J. Pérez-Jiménez, A. Riscos-Núñez, eds.), University of Seville, RGNC Report 3/2009, 514-533, 2009.

R. Brijder, H.J. Hoogeboom.

The Fibers and Range of Reduction Graphs in Ciliates.
Acta Informatica 45 (2008) 383-402.
doi:10.1007/s00236-008-0074-3
VIEWS . arXiv.org/abs/cs/0702041 .

R. Brijder, H.J. Hoogeboom.

Extending the Overlap Graph for Gene Assembly in Ciliates.
In: Language and Automata Theory and Applications, 2nd International Conference, LATA 2008 (C. Martín-Vide, F. Otto, H. Fernau, eds.), Lecture Notes in Computer Science, v. 5196, 137-148, 2008.
doi:10.1007/978-3-540-88282-4_14
VIEWS . arXiv.org/abs/0712.3380 .

R. Brijder, H.J. Hoogeboom, M. Muskulus.

Strategies of Loop Recombination in Ciliates.
Discrete Applied Mathematics 156 (2008) 1736-1753.
doi:10.1016/j.dam.2007.08.032
VIEWS . arXiv.org/abs/cs/0601135 .

H.J. Hoogeboom, J.F.J. Laros, W.A. Kosters.

Selection of DNA Markers.
IEEE Transactions on Systems, Man, and Cybernetics - Part C: Applications and Reviews 38 (2008) 26-32.
doi:10.1109/TSMCC.2007.906060

R. Brijder, H.J. Hoogeboom.

Characterizing Reduction Graphs for Gene Assembly in Ciliates.
In: 11th International Conference on Developments in Language Theory, DLT 2007 (T. Harju, J. Karhumäki, A. Lepistö, eds.), Lecture Notes in Computer Science, v. 4588, 120-131, 2007.
doi:10.1007/978-3-540-73208-2_14
VIEWS .

R. Brijder, H.J. Hoogeboom.

Perfectly Quilted Rectangular Snake Tilings.
In: Proceedings of the Workshop on Tilings and Self-Assembly (J. Kari, ed.), TUCS General Publication, v. 45, June 2007.
Journal paper in 2009 .

R. Brijder, H.J. Hoogeboom.

Using Sorting by Reversal: Breakpoint Graph for Gene Assembly in Ciliates.
In: CompLife 2007: The Third International Symposium on Computational Life Sciences (A.P.J.M. Siebes, M.R. Berthold, R.C. Glen, A.J. Feelders, eds.), AIP Conference Proceedings, v. 940, 50-59, 2007.
doi:10.1063/1.2793404
VIEWS .

R. Brijder, H.J. Hoogeboom, G. Rozenberg.

From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates.
In: Fundamentals of Computation Theory, 16th International Symposium, FCT 2007 (E. Csuhaj-Varjú, Z. Ésik, eds.), Lecture Notes in Computer Science, v. 4639, 149-160, 2007.
doi:10.1007/978-3-540-74240-1_14
VIEWS . Journal paper in 2009 .

A. Deutz, R. van Vliet, H.J. Hoogeboom.

High Spies, or How to win a programming contest.
In: Fun with Algorithms, FUN 2007 (P. Crescenzi, G. Prencipe, G. Pucci, eds.), Lecture Notes in Computer Science, v. 4475, 93-107, 2007.
doi:10.1007/978-3-540-72914-3_10
web www.liacs.nl/~rvvliet/highspies/ .

J. Engelfriet, H.J. Hoogeboom.

Automata with nested pebbles capture first-order logic with transitive closure.
Logical Methods in Computer Science 3(2:3) (2007) 1-27.
doi:10.2168/LMCS-3(2:3)2007
presented at STACS 2006 . MathSciNet .

J. Engelfriet, H.J. Hoogeboom.

Finitary Compositions of Two-way Finite-State Transductions.
Fundamenta Informaticae 80 (2007) 111-123.

J. Engelfriet, H.J. Hoogeboom, B. Samwel.

XML Transformation by Tree-Walking Transducers with Invisible Pebbles.
In: Proceedings of the twenty-sixth ACM Symposium on Principles of Database Systems, PODS 2007 (L. Libkin, ed.), ACM Press, 63-72, 2007.
doi:10.1145/1265530.1265540
best newcomer award . author version .

Y. Gao, H.J. Hoogeboom.

P Systems with Single Passenger Carriers.
International Journal of Foundations of Computer Science 17 (2007) 1227-1235.
doi:10.1142/S0129054107005273
VIEWS .

R. Brijder, H.J. Hoogeboom, M. Muskulus.

Applicability of Loop Recombination in Ciliates using the Breakpoint Graph.
In: CompLife 2006 (M.R. Berthold et al., ed.), Lecture Notes in Bioinformatics , v. 4216, 97-106, 2006.
doi:10.1007/11875741_10
VIEWS . MathSciNet .

R. Brijder, H.J. Hoogeboom, G. Rozenberg.

Reducibility of Gene Patterns in Ciliates using the Breakpoint Graph.
Theoretical Computer Science 356 (2006) 26-45.
doi:10.1016/j.tcs.2006.01.041
VIEWS . arXiv.org/abs/cs/0601122 .

M. Cavaliere, P. Frisco, H.J. Hoogeboom.

Computing by Only Observing.
In: Developments in Language Theory: 10th International Conference, DLT 2006 (O.H. Ibarra, Z. Dang, eds.), Lecture Notes in Computer Science, v. 4036, 304-314, 2006.
doi:10.1007/11779148_28
DLT 2006 .

J. Engelfriet, H.J. Hoogeboom.

Nested Pebbles and Transitive Closure.
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science (B. Durand, W. Thomas, eds.), Lecture Notes in Computer Science, v. 3884, 477-488, 2006.
doi:10.1007/11672142_39
Full paper published in 2007 .

H.J. Hoogeboom, G. Paun, G. Rozenberg, A. Salomaa (eds.).

Membrane Computing, Seventh International Workshop, WMC7. Lecture Notes in Computer Science, volume 4361, 2006.
doi:10.1007/11963516
VIEWS .

R. van Vliet, H.J. Hoogeboom, G. Rozenberg.

The construction of minimal DNA expressions.
Natural Computing 5 (2006) 127-149.
doi:10.1007/s11047-005-4464-y
MathSciNet .

R. Brijder, H.J. Hoogeboom, G. Rozenberg.

The Breakpoint Graph in Ciliates.
In: CompLife 2005 (M.R. Berthold et al., ed.), Lecture Notes in Bioinformatics , v. 3695, 128-139, 2005.
doi:10.1007/11560500_12
VIEWS .

V. Halava, T. Harju, H.J. Hoogeboom, M. Latteux.

Equality sets for recursively enumerable languages.
R.A.I.R.O. -- Informatique Théorique et Applications 39 (2005) 661-675.
doi:10.1051/ita:2005035

H.J. Hoogeboom.

Klein Duimpje.
Eureka! (Januari 2005) 18-19.
PDF .

H.J. Hoogeboom, W.A. Kosters.

The Theory of Tetris.
Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica 9 (2005) 14-21.
author version .

R. van Vliet, H.J. Hoogeboom, G. Rozenberg.

Combinatorial aspects of minimal DNA expressions.
In: 10th International meeting on DNA computing, DNA10, June 7-10, 2004, Milan, Italy -- Revised selected papers (C. Ferretti, G. Mauri, C. Zandron, eds.), Lecture Notes in Computer Science, v. 3384, 375-388, 2005.
doi:10.1007/11493785_33

R. Breukelaar, E.D. Demaine, S. Hohenberger, H.J. Hoogeboom, W.A. Kosters, D. Liben-Nowell.

Tetris is Hard, Even to Approximate.
Special Issue: Selected Papers from the Ninth International Computing and Combinatorics Conference (COCOON 2003), Big Sky, MT, USA, July 2003. International Journal of Computational Geometry and Applications 14 (2004) 41-68.
doi:10.1142/S0218195904001354
MathSciNet .

P. Frisco, H.J. Hoogeboom.

P systems with symport/antiport simulating counter automata.
Acta Informatica 41 (2004) 145-170.
doi:10.1007/s00236-004-0154-y
conference paper at WMC-CdeA 2002 .

V. Halava, T. Harju, H.J. Hoogeboom, M. Latteux.

Valence Languages Generated by Equality Sets.
Journal of Automata, Languages and Combinatorics 9 (2004) 339-406.
Technical Report . MathSciNet .

H.J. Hoogeboom, J. Engelfriet.

Pushdown Automata.
In: Formal Languages and Applications (C. Martín-Vide, V. Mitrana, G. Paun, eds.), Studies in Fuzziness and Soft Computing, v. 148, Springer, Berlin, 117-138, 2004.
pdf-file . google books .

H.J. Hoogeboom, W.A. Kosters.

Tetris and Decidability.
Information Processing Letters 89 (2004) 267-272.
doi:10.1016/j.ipl.2003.12.006
MathSciNet .

H.J. Hoogeboom, W.A. Kosters.

How to Construct Tetris Configurations.
International Journal of Intelligent Games and Simulation 3 (2004) 94-102.
see Tetris .

H.J. Hoogeboom, G. Rozenberg.

DNA Computing - Computer in de Reageerbuis.
In: De wiskundige kat, de biologische muis en de jacht op inzicht (J.A.P. Heesterbeek, O. Diekmann, J.A.J. Metz, eds.), Epsilon deel 55, Epsilon Uitgaven Utrecht, 2004.
Epsilon Uitgaven .

R. van Vliet, H.J. Hoogeboom, G. Rozenberg.

Combinatorial Aspects of Minimal DNA Expressions.
In: preliminary proceedings DNA10, June 2004, Milano (C. Ferretti, G. Mauri, C. Zandron, eds.), 84-96, 2004.
Final proceedings in 2005 .

R. Breukelaar, H.J. Hoogeboom, W.A. Kosters.

Tetris is Hard, Made Easy.
LIACS Technical Report 2003-09, 2003.
Published in 2004 (IJCGA) . Technical Report .

P. Frisco, H.J. Hoogeboom.

Simulating counter automata by P systems with symport/antiport.
In: Membrane Computing, International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19-23, 2002. Revised Papers (Gh. Paun, C. Zandron, eds.), Lecture Notes in Computer Science, v. 2597, 288-301, 2003.
doi:10.1007/3-540-36490-0_19

V. Halava, T. Harju, H.J. Hoogeboom, M. Latteux.

Languages defined by Generalized Equality Sets.
In: Fundamentals of Computation Theory, 14th International Symposium FCT 2003, Malmö Sweden (A. Lingas, B.J. Nilsson, eds.), Lecture Notes in Computer Science, v. 2751, 355-363, 2003.
doi:10.1007/b11926
Journal paper in 2005 .

H.J. Hoogeboom.

Carriers and Counters: P systems with Carriers vs. (Blind) Counter Automata.
In: Developments in Language Theory, DLT 2002, revised papers (M. Ito, M. Toyama, eds.), Lecture Notes in Computer Science, v. 2450, 140-151, 2003.
doi:10.1007/3-540-45005-X_12

P. Frisco, H.J. Hoogeboom, P. Sant.

A Direct Construction of a Universal P System.
Workshop on Multiset Processing, Curtea de Arges, Romania (August 2001). Fundamenta Informaticae 49 (2002) 103-122.

H.J. Hoogeboom.

Context-Free Valence Grammars - Revisited.
In: Developments in Language Theory, DLT 2001 (W. Kuich, G. Rozenberg, A. Salomaa, eds.), Lecture Notes in Computer Science, v. 2295, 293-303, 2002.
doi:10.1007/3-540-46011-X_25
technical report . MathSciNet .

H.J. Hoogeboom, N. van Vugt.

Upper Bounds for Restricted Splicing.
In: Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg (W. Brauer, H. Ehrig, J. Karhumäki, A. Salomaa, eds.), Lecture Notes in Computer Science, v. 2300, Springer Verlag, 361-375, 2002.
doi:10.1007/3-540-45711-9_20
technical report .

A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg, N. van Vugt.

Sequences of languages in forbidding-enforcing families.
Soft Computing 5 (2001) 121-125.
doi:10.1007/s005000000072

J. Engelfriet, H.J. Hoogeboom.

MSO Definable String Transductions and Two-Way Finite State Transducers.
ACM Transactions on Computational Logic 2 (2001) 216-254.
doi:10.1145/371316.371512
arXiv:cs/9906007 . MathSciNet .

R. Dassen, H.J. Hoogeboom, N. van Vugt.

A Characterization of non-iterated splicing with regular rules.
In: Where Mathematics, Computer Science and Biology Meet (C. Martin-Vide, V. Mitrana, eds.), Kluwer Academic Publishers, 319-327, November 2000.
technical report . MathSciNet .

A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg, N. van Vugt.

Forbidding and Enforcing.
In: DNA Based Computers V (E. Winfree, D. Gifford, eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, v. 54, 195-206, 2000.
MathSciNet .

H.J. Hoogeboom, N. van Vugt.

Fair Sticker Languages.
Acta Informatica 37 (2000) 213-225.
doi:10.1007/PL00006050
technical report . MathSciNet .

J. Engelfriet, H.J. Hoogeboom.

Tree-walking pebble automata.
In: Jewels are forever, contributions to Theoretical Computer Science in honor of Arto Salomaa (J. Karhumäki, H. Maurer, G. Paun, G. Rozenberg, eds.), Springer Verlag, 72-83, 1999.

J. Engelfriet, H.J. Hoogeboom.

Two-way finite state transducers and monadic second-order logic.
In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99 (J. Wiedermann, P. van Emde Boas, M. Nielsen, eds.), Lecture Notes in Computer Science, v. 1644, Springer Verlag, 311-320, 1999.
doi:10.1007/3-540-48523-6_28
Full paper in ACMToCL 2001 .

J. Engelfriet, H.J. Hoogeboom, J.-P. van Best.

Trips on Trees.
Acta Cybernetica 14 (1999) 51-64.
Acta Cybernetica .

H.J. Hoogeboom, N. van Vugt.

The power of H systems: does representation matter?.
In: Computing with bio-molecules (G. Paun, ed.), Springer-Verlag, Singapore, 255-268, 1998.
technical report .

H.J. Hoogeboom, A. Muscholl.

The code problem for traces - improving the boundaries.
Theoretical Computer Science 172 (1997) 309-321.
doi:10.1016/S0304-3975(96)00216-2
MathSciNet .

H.J. Hoogeboom, P. ten Pas.

Monadic Second-Order Definable Text Languages.
Theory of Computing Systems 30 (1997) 335-354.
doi:10.1007/s002240000055
conference version . MathSciNet .

H.J. Hoogeboom, P. ten Pas.

Text Languages in an Algebraic Framework.
Fundamenta Informaticae 25 (1995) 353-380.
technical report . MathSciNet .

H.J. Hoogeboom, G. Rozenberg.

Dependence Graphs.
In: The Book of Traces, World Scientific, 43-68, 1995.

A. Ehrenfeucht, H.J. Hoogeboom, P. ten Pas, G. Rozenberg.

An Introduction to Context-free Text Grammars.
In: Developments in Language Theory, World Scientific, 357-369, 1994.

A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg.

Combinatorial Properties of Dependence Graphs.
Information and Computation 114 (1994) 315-328.
doi:10.1006/inco.1994.1089
MathSciNet .

T. Harju, H.J. Hoogeboom, H.C.M. Kleijn.

Identities and Transductions.
In: Results and Trends in Theoretical Computer Science (J. Karhumäki, H. Maurer, G. Rozenberg, eds.), Lecture Notes in Computer Science, v. 812, 140-144, 1994.
doi:10.1007/3-540-58131-6_43

H.J. Hoogeboom, P. ten Pas.

MSO Definable Text Languages.
In: Mathematical Foundations of Computer Science 1994 (I. Privara, B. Rovan, P. Ruzicka, eds.), Lecture Notes in Computer Science, v. 841, Springer-Verlag, 413-422, 1994.
doi:10.1007/3-540-58338-6_88
Journal paper in 1997 . conference version .

A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg.

On the structure of recognizable languages of dependence graphs.
R.A.I.R.O. -- Informatique Théorique et Applications 27 (1993) 7-22.
MathSciNet .

J. Engelfriet, H.J. Hoogeboom.

X-automata on omega-words.
Theoretical Computer Science 110 (1993) 1-51.
doi:10.1016/0304-3975(93)90349-X
MathSciNet .

H.J. Hoogeboom, G. Rozenberg.

Diamond properties of elementary net systems.
Fundamenta Informaticae XIV (1991) 287-300.
scan .

IJ.J. Aalbersberg, H.J. Hoogeboom.

Characterization of the decidability of some problems for regular trace languages.
Mathematical Systems Theory 22 (1989) 1-19.
doi:10.1007/BF02088289

J. Engelfriet, H.J. Hoogeboom.

Automata with storage on infinite words.
In: Automata, Languages and Programming (G. Ausiello, M. Dezani-Ciancaglini, S. Ronchi Della Rocca, eds.), Lecture Notes in Computer Science, v. 372, 289-303, 1989.
doi:10.1007/BFb0035767
Journal paper in 1993 .

A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg.

Recording the use of memory in right-boundary grammars and push-down automata.
Acta Informatica 25 (1988) 203-231.
doi:10.1007/BF00263585

J. Engelfriet, H.J. Hoogeboom.

Prefix and equality languages of rational functions are co-context-free.
Information Processing Letters 28 (1988) 77-79.
doi:10.1016/0020-0190(88)90167-6
MathSciNet .

IJ.J. Aalbersberg, H.J. Hoogeboom.

Decision problems for regular trace languages.
In: Automata, Languages and Computation, 14th international colloquium (Th. Ottmann, ed.), Lecture Notes in Computer Science, v. 267, 250-259, 1987.
doi:10.1007/3-540-18088-5_20
Journal paper in 1989 .

H.J. Hoogeboom.

Coordinated pair systems. Ph.D. Thesis, Leiden University, 1987.

A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg.

Computations in coordinated pair systems.
Fundamenta Informaticae IX (1986) 445-480.

A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg.

Coordinated pair systems; Part I: Dyck words and classical pumping.
R.A.I.R.O. -- Informatique Théorique et Applications 20 (1986) 405-424.

A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg.

Coordinated pair systems; Part II: Sparse structure of Dyck words and Ogden's Lemma.
R.A.I.R.O. -- Informatique Théorique et Applications 20 (1986) 425-439.

A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg.

On the active and full use of memory in right-boundary grammars and push-down automata.
Theoretical Computer Science 48 (1986) 201-228.
doi:10.1016/0304-3975(86)90095-2

H.J. Hoogeboom, G. Rozenberg.

Infinitary languages: basic theory and applications to concurrent systems.
In: Current trends in concurrency (J.W. de Bakker, W.P. de Roever, G. Rozenberg, eds.), Lecture Notes in Computer Science, v. 224, Springer Verlag, 266-342, 1986.
doi:10.1007/BFb0027043

A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg.

On coordinated rewriting.
In: Fundamentals of Computation Theory (L. Budach, ed.), Lecture Notes in Computer Science, v. 199, 100-111, 1985.
doi:10.1007/BFb0028796