Hendrik Jan Hoogeboom

110 papers A* 4A 1B 5C 9Misc 1Journal 74Unranked 12

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Enabling equivalence and its cover relation for reaction systems. Nat. Comput. Daniela Genova, Hendrik Jan Hoogeboom, Jetty Kleijn
2024	J	`jnl`	Functional equivalence and a cover relation for reaction systems. Theor. Comput. Sci. Daniela Genova, Hendrik Jan Hoogeboom, Jetty Kleijn
2022	J	`jnl`	Deterministic Non-cooperative Binding in Two-Dimensional Tile Assembly Systems Must Have Ultimately Periodic Paths. CoRR Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Natasa Jonoska
2021	J	`jnl`	Comparing reactions in reaction systems. Theor. Comput. Sci. Daniela Genova, Hendrik Jan Hoogeboom, Jetty Kleijn
2021	J	`jnl`	XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles. Theor. Comput. Sci. Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel
2020	J	`jnl`	Companions and an Essential Motion of a Reaction System. Fundam. Informaticae Daniela Genova, Hendrik Jan Hoogeboom, Natasa Jonoska
2020	J	`jnl`	Counterexamples to a conjecture of Las Vergnas. Eur. J. Comb. Robert Brijder, Hendrik Jan Hoogeboom
2020	J	`jnl`	Extracting reaction systems from function behavior. J. Membr. Comput. Daniela Genova, Hendrik Jan Hoogeboom, Zornitza Genova Prodanoff
2019	J	`jnl`	Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute. CoRR Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Natasa Jonoska
2018	J	`jnl`	XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles. CoRR Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel
2017	J	`jnl`	A graph isomorphism condition and equivalence of reaction systems. Theor. Comput. Sci. Daniela Genova, Hendrik Jan Hoogeboom, Natasa Jonoska
2017	J	`jnl`	Enforcing Regular Languages. Fundam. Informaticae Daniela Genova, Hendrik Jan Hoogeboom
2017	C	`conf`	Finite Language Forbidding-Enforcing Systems. CiE Daniela Genova, Hendrik Jan Hoogeboom
2016	J	`jnl`	Acyclic Constraint Logic and Games. CoRR Hendrik Jan Hoogeboom, Walter A. Kosters, Jan N. van Rijn, Jonathan K. Vis
2014	J	`jnl`	Acyclic Constraint Logic and Games. ICGA J. Hendrik Jan Hoogeboom, Walter A. Kosters, Jan N. van Rijn, Jonathan K. Vis
2014	C	`conf`	Graph Polynomials Motivated by Gene Rearrangements in Ciliates. CiE Robert Brijder, Hendrik Jan Hoogeboom
2014	J	`jnl`	Interlace polynomials for multimatroids and delta-matroids. Eur. J. Comb. Robert Brijder, Hendrik Jan Hoogeboom
2014	—	`ch.`	The Algebra of Gene Assembly in Ciliates. Discrete and Topological Models in Molecular Biology Robert Brijder, Hendrik Jan Hoogeboom
2013	J	`jnl`	A Minimal Normal Form for DNA Expressions. Fundam. Informaticae Rudy van Vliet, Hendrik Jan Hoogeboom
2013	J	`jnl`	Making DNA Expressions Minimal. Fundam. Informaticae Rudy van Vliet, Hendrik Jan Hoogeboom
2013	J	`jnl`	Nullity and Loop Complementation for Delta-Matroids. SIAM J. Discret. Math. Robert Brijder, Hendrik Jan Hoogeboom
2013	J	`jnl`	The Adjacency Matroid of a Graph. Electron. J. Comb. Lorenzo Traldi, Robert Brijder, Hendrik Jan Hoogeboom
2012	J	`jnl`	Binary Symmetric Matrix Inversion Through Local Complementation. Fundam. Informaticae Robert Brijder, Hendrik Jan Hoogeboom
2012	J	`jnl`	Pivots, determinants, and perfect matchings of graphs. Theor. Comput. Sci. Robert Brijder, Tero Harju, Hendrik Jan Hoogeboom
2012	J	`jnl`	Preface. Theor. Comput. Sci. Giorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre, Arto Salomaa
2012	J	`jnl`	Spiking Neural P Systems with Astrocytes. Neural Comput. Linqiang Pan, Jun Wang, Hendrik Jan Hoogeboom
2011	—	`conf`	Asynchronous Extended Spiking Neural P Systems with Astrocytes. Int. Conf. on Membrane Computing Linqiang Pan, Jun Wang, Hendrik Jan Hoogeboom
2011	J	`jnl`	Limited Asynchronous Spiking Neural P Systems. Fundam. Informaticae Linqiang Pan, Jun Wang, Hendrik Jan Hoogeboom
2011	J	`jnl`	On aggregation in multiset-based self-assembly of graphs. Nat. Comput. Francesco Bernardini, Robert Brijder, Matteo Cavaliere, Giuditta Franco, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
2011	J	`jnl`	P Systems and Topology: Some Suggestions for Research. Int. J. Found. Comput. Sci. Pierluigi Frisco, Hendrik Jan Hoogeboom
2011	J	`jnl`	The group structure of pivot and loop complementation on graphs and set systems. Eur. J. Comb. Robert Brijder, Hendrik Jan Hoogeboom
2010	J	`jnl`	Combining overlap and containment for gene assembly in ciliates. Theor. Comput. Sci. Robert Brijder, Hendrik Jan Hoogeboom
2010	J	`jnl`	Maximal pivots on graphs with an application to gene assembly. Discret. Appl. Math. Robert Brijder, Hendrik Jan Hoogeboom
2010	C	`conf`	Pivot and Loop Complementation on Graphs and Set Systems. TAMC Robert Brijder, Hendrik Jan Hoogeboom
2010	—	`conf`	Spiking Neural P Systems with Neuron Division. Int. Conf. on Membrane Computing Jun Wang, Hendrik Jan Hoogeboom, Linqiang Pan
2010	J	`jnl`	Spiking Neural P Systems with Weights. Neural Comput. Jun Wang, Hendrik Jan Hoogeboom, Linqiang Pan, Gheorghe Paun, Mario J. Pérez-Jiménez
2009	—	`conf`	Automata Walking over Trees and Graphs. NCMA Hendrik Jan Hoogeboom
2009	J	`jnl`	Maximal Pivots on Graphs with an Application to Gene Assembly CoRR Robert Brijder, Hendrik Jan Hoogeboom
2009	J	`jnl`	Nullity Invariance for Pivot and the Interlace Polynomial CoRR Robert Brijder, Hendrik Jan Hoogeboom
2009	J	`jnl`	Perfectly quilted rectangular snake tilings. Theor. Comput. Sci. Robert Brijder, Hendrik Jan Hoogeboom
2009	—	`conf`	Reality-and-Desire in Ciliates. Algorithmic Bioprocesses Robert Brijder, Hendrik Jan Hoogeboom
2009	J	`jnl`	Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates. Int. J. Found. Comput. Sci. Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
2009	J	`jnl`	The Group Structure of Pivot and Loop Complementation on Graphs and Set Systems CoRR Robert Brijder, Hendrik Jan Hoogeboom
2008	C	`conf`	Extending the Overlap Graph for Gene Assembly in Ciliates. LATA Robert Brijder, Hendrik Jan Hoogeboom
2008	J	`jnl`	Selection of DNA Markers. IEEE Trans. Syst. Man Cybern. Part C Hendrik Jan Hoogeboom, Walter A. Kosters, Jeroen F. J. Laros
2008	J	`jnl`	Strategies of loop recombination in ciliates. Discret. Appl. Math. Robert Brijder, Hendrik Jan Hoogeboom, Michael Muskulus
2008	J	`jnl`	The fibers and range of reduction graphs in ciliates. Acta Informatica Robert Brijder, Hendrik Jan Hoogeboom
2007	J	`jnl`	Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure CoRR Joost Engelfriet, Hendrik Jan Hoogeboom
2007	J	`jnl`	Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure. Log. Methods Comput. Sci. Joost Engelfriet, Hendrik Jan Hoogeboom
2007	C	`conf`	Characterizing Reduction Graphs for Gene Assembly in Ciliates. Developments in Language Theory Robert Brijder, Hendrik Jan Hoogeboom
2007	J	`jnl`	Extending the Overlap Graph for Gene Assembly in Ciliates CoRR Robert Brijder, Hendrik Jan Hoogeboom
2007	J	`jnl`	Finitary Compositions of Two-way Finite-State Transductions. Fundam. Informaticae Joost Engelfriet, Hendrik Jan Hoogeboom
2007	B	`conf`	From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates. FCT Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
2007	Misc	`conf`	High Spies (or How to Win a Programming Contest). FUN André H. Deutz, Rudy van Vliet, Hendrik Jan Hoogeboom
2007	J	`jnl`	How Overlap Determines the Macronuclear Genes in Ciliates CoRR Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
2007	J	`jnl`	P Systems with Single passenger Carriers. Int. J. Found. Comput. Sci. Yan Gao, Hendrik Jan Hoogeboom
2007	J	`jnl`	The Fibers and Range of Reduction Graphs in Ciliates CoRR Robert Brijder, Hendrik Jan Hoogeboom
2007	A*	`conf`	XML transformation by tree-walking transducers with invisible pebbles. PODS Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel
2006	—	`conf`	Applicability of Loop Recombination in Ciliates Using the Breakpoint Graph. CompLife Robert Brijder, Hendrik Jan Hoogeboom, Michael Muskulus
2006	C	`conf`	Computing by Only Observing. Developments in Language Theory Matteo Cavaliere, Pierluigi Frisco, Hendrik Jan Hoogeboom
2006	—	`ed.`	Membrane Computing, 7th International Workshop, WMC 2006, Leiden, The Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers Workshop on Membrane Computing Hendrik Jan Hoogeboom, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa
2006	A	`conf`	Nested Pebbles and Transitive Closure. STACS Joost Engelfriet, Hendrik Jan Hoogeboom
2006	J	`jnl`	Reducibility of Gene Patterns in Ciliates using the Breakpoint Graph CoRR Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
2006	J	`jnl`	Reducibility of gene patterns in ciliates using the breakpoint graph. Theor. Comput. Sci. Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
2006	J	`jnl`	Strategies of Loop Recombination in Ciliates CoRR Robert Brijder, Hendrik Jan Hoogeboom, Michael Muskulus
2006	J	`jnl`	The Construction of Minimal DNA Expressions. Nat. Comput. Rudy van Vliet, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
2005	J	`jnl`	Equality sets for recursively enumerable languages. RAIRO Theor. Informatics Appl. Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
2005	—	`conf`	The Breakpoint Graph in Ciliates. CompLife Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
2004	B	`conf`	Combinatorial Aspects of Minimal DNA Expressions. DNA Rudy van Vliet, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
2004	J	`jnl`	How to Construct Tetris Configurations. Int. J. Intell. Games Simul. Hendrik Jan Hoogeboom, Walter A. Kosters
2004	J	`jnl`	P systems with symport/antiport simulating counter automata. Acta Informatica Pierluigi Frisco, Hendrik Jan Hoogeboom
2004	J	`jnl`	Tetris and decidability. Inf. Process. Lett. Hendrik Jan Hoogeboom, Walter A. Kosters
2004	J	`jnl`	Tetris is hard, even to approximate. Int. J. Comput. Geom. Appl. Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter A. Kosters, David Liben-Nowell
2004	J	`jnl`	Valence Languages Generated by Equality Sets. J. Autom. Lang. Comb. Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
2003	B	`conf`	Languages Defined by Generalized Equality Sets. FCT Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
2002	J	`jnl`	A Direct Construction of a Universal P System. Fundam. Informaticae Pierluigi Frisco, Hendrik Jan Hoogeboom, Paul Sant
2002	C	`conf`	Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata. Developments in Language Theory Hendrik Jan Hoogeboom
2002	—	`conf`	Simulating Counter Automata by P Systems with Symport/Antiport. WMC-CdeA Pierluigi Frisco, Hendrik Jan Hoogeboom
2002	—	`conf`	Upper Bounds for Restricted Splicing. Formal and Natural Computing Hendrik Jan Hoogeboom, Nike van Vugt
2001	—	`conf`	A characterization of non-iterated splicing with regular rules. Where Mathematics, Computer Science, Linguistics and Biology Meet Ray Dassen, Hendrik Jan Hoogeboom, Nike van Vugt
2001	C	`conf`	Context-Free Valence Grammars - Revisited. Developments in Language Theory Hendrik Jan Hoogeboom
2001	J	`jnl`	MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. Joost Engelfriet, Hendrik Jan Hoogeboom
2001	J	`jnl`	Sequences of languages in forbidding-enforcing families. Soft Comput. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg, Nike van Vugt
2000	J	`jnl`	Fair sticker languages. Acta Informatica Hendrik Jan Hoogeboom, Nike van Vugt
1999	—	`conf`	Forbidding and enforcing. DNA Based Computers Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg, Nike van Vugt
1999	J	`jnl`	MSO definable string transductions and two-way finite state transducers CoRR Joost Engelfriet, Hendrik Jan Hoogeboom
1999	—	`conf`	Tree-Walking Pebble Automata. Jewels are Forever Joost Engelfriet, Hendrik Jan Hoogeboom
1999	J	`jnl`	Trips on Trees. Acta Cybern. Joost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal van Best
1999	A*	`conf`	Two-Way Finite State Transducers and Monadic Second-Order Logic. ICALP Joost Engelfriet, Hendrik Jan Hoogeboom
1997	J	`jnl`	Monadic Second-Order Definable Text Languages. Theory Comput. Syst. Hendrik Jan Hoogeboom, Paulien ten Pas
1997	J	`jnl`	The Code Problem for Traces - Improving the Boundaries. Theor. Comput. Sci. Hendrik Jan Hoogeboom, Anca Muscholl
1996	J	`jnl`	Text Languages in an Algebraic Framework. Fundam. Informaticae Hendrik Jan Hoogeboom, Paulien ten Pas
1995	—	`ch.`	Dependence Graphs. The Book of Traces Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1994	J	`jnl`	Combinatorial Properties of Dependence Graphs Inf. Comput. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1994	—	`conf`	Identities and Transductions. Results and Trends in Theoretical Computer Science Tero Harju, Hendrik Jan Hoogeboom, H. C. M. Kleijn
1994	B	`conf`	MSO Definable Text Languages. MFCS Hendrik Jan Hoogeboom, Paulien ten Pas
1993	C	`conf`	An Introduction to Context-free Text Grammars. Developments in Language Theory Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Paulien ten Pas, Grzegorz Rozenberg
1993	J	`jnl`	On the Structure of Recognizable Languages of Dependence Graphs. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1993	J	`jnl`	X-Automata on omega-Words. Theor. Comput. Sci. Joost Engelfriet, Hendrik Jan Hoogeboom
1991	J	`jnl`	Diamond properties of elementary net systems. Fundam. Informaticae Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1989	A*	`conf`	Automata with Storage on Infinite Words. ICALP Joost Engelfriet, Hendrik Jan Hoogeboom
1989	J	`jnl`	Characterizations of the Decidability of Some Problems for Regular Trace Languages. Math. Syst. Theory IJsbrand Jan Aalbersberg, Hendrik Jan Hoogeboom
1988	J	`jnl`	Prefix and Equality Languages of Rational Functions are Co-Context-Free. Inf. Process. Lett. Joost Engelfriet, Hendrik Jan Hoogeboom
1988	J	`jnl`	Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata. Acta Informatica Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1987	A*	`conf`	Decision Problems for Regular Trace Languages. ICALP IJsbrand Jan Aalbersberg, Hendrik Jan Hoogeboom
1986	J	`jnl`	Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1986	J	`jnl`	Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1986	—	`ch.`	Infinitary Languages: Basic Theory an Applications to Concurrent Systems. Current Trends in Concurrency Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1986	J	`jnl`	On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata. Theor. Comput. Sci. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1985	B	`conf`	On coordinated rewriting. FCT Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg