Hendrik Jan Hoogeboom
According to our database1, Hendrik Jan Hoogeboom authored at least 86 papers between 1985 and 2017.
Legend:Book In proceedings Article PhD thesis Other
A graph isomorphism condition and equivalence of reaction systems.
Theor. Comput. Sci., 2017
Enforcing Regular Languages.
Fundam. Inform., 2017
Finite Language Forbidding-Enforcing Systems.
Proceedings of the Unveiling Dynamics and Complexity, 2017
Acyclic Constraint Logic and Games.
ICGA Journal, 2014
Interlace polynomials for multimatroids and delta-matroids.
Eur. J. Comb., 2014
Graph Polynomials Motivated by Gene Rearrangements in Ciliates.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014
Nullity and Loop Complementation for Delta-Matroids.
SIAM J. Discrete Math., 2013
A Minimal Normal Form for DNA Expressions.
Fundam. Inform., 2013
Making DNA Expressions Minimal.
Fundam. Inform., 2013
The Adjacency Matroid of a Graph.
Electr. J. Comb., 2013
Pivots, determinants, and perfect matchings of graphs.
Theor. Comput. Sci., 2012
Theor. Comput. Sci., 2012
Spiking Neural P Systems with Astrocytes.
Neural Computation, 2012
Binary Symmetric Matrix Inversion Through Local Complementation.
Fundam. Inform., 2012
On aggregation in multiset-based self-assembly of graphs.
Natural Computing, 2011
P Systems and Topology: Some Suggestions for Research.
Int. J. Found. Comput. Sci., 2011
Limited Asynchronous Spiking Neural P Systems.
Fundam. Inform., 2011
The group structure of pivot and loop complementation on graphs and set systems.
Eur. J. Comb., 2011
Asynchronous Extended Spiking Neural P Systems with Astrocytes.
Proceedings of the Membrane Computing, 2011
Combining overlap and containment for gene assembly in ciliates.
Theor. Comput. Sci., 2010
Spiking Neural P Systems with Weights.
Neural Computation, 2010
Maximal pivots on graphs with an application to gene assembly.
Discrete Applied Mathematics, 2010
Pivot and Loop Complementation on Graphs and Set Systems.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010
Spiking Neural P Systems with Neuron Division.
Proceedings of the Membrane Computing, 2010
Perfectly quilted rectangular snake tilings.
Theor. Comput. Sci., 2009
Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates.
Int. J. Found. Comput. Sci., 2009
Automata Walking over Trees and Graphs.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009
Reality-and-Desire in Ciliates.
Proceedings of the Algorithmic Bioprocesses, 2009
Selection of DNA Markers.
IEEE Trans. Systems, Man, and Cybernetics, Part C, 2008
Strategies of loop recombination in ciliates.
Discrete Applied Mathematics, 2008
The fibers and range of reduction graphs in ciliates.
Acta Inf., 2008
Extending the Overlap Graph for Gene Assembly in Ciliates.
Proceedings of the Language and Automata Theory and Applications, 2008
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure.
Logical Methods in Computer Science, 2007
P Systems with Single passenger Carriers.
Int. J. Found. Comput. Sci., 2007
Finitary Compositions of Two-way Finite-State Transductions.
Fundam. Inform., 2007
XML transformation by tree-walking transducers with invisible pebbles.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007
High Spies (or How to Win a Programming Contest).
Proceedings of the Fun with Algorithms, 4th International Conference, 2007
From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007
Characterizing Reduction Graphs for Gene Assembly in Ciliates.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007
Reducibility of gene patterns in ciliates using the breakpoint graph.
Theor. Comput. Sci., 2006
The Construction of Minimal DNA Expressions.
Natural Computing, 2006
Nested Pebbles and Transitive Closure.
Proceedings of the STACS 2006, 2006
Computing by Only Observing.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006
Applicability of Loop Recombination in Ciliates Using the Breakpoint Graph.
Proceedings of the Computational Life Sciences II, 2006
Equality sets for recursively enumerable languages.
The Breakpoint Graph in Ciliates.
Proceedings of the Computational Life Sciences, First International Symposium, 2005
Valence Languages Generated by Equality Sets.
Journal of Automata, Languages and Combinatorics, 2004
Tetris and decidability.
Inf. Process. Lett., 2004
How to Construct Tetris Configurations.
Int. J. Intell. Games & Simulation, 2004
Tetris is hard, even to approximate.
Int. J. Comput. Geometry Appl., 2004
P systems with symport/antiport simulating counter automata.
Acta Inf., 2004
Combinatorial Aspects of Minimal DNA Expressions.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004
Languages Defined by Generalized Equality Sets.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003
A Direct Construction of a Universal P System.
Fundam. Inform., 2002
Simulating Counter Automata by P Systems with Symport/Antiport.
Proceedings of the Membrane Computing, International Workshop, 2002
Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002
Upper Bounds for Restricted Splicing.
Proceedings of the Formal and Natural Computing, 2002
MSO definable string transductions and two-way finite-state transducers.
ACM Trans. Comput. Log., 2001
Sequences of languages in forbidding-enforcing families.
Soft Comput., 2001
Context-Free Valence Grammars - Revisited.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001
A characterization of non-iterated splicing with regular rules.
Proceedings of the Where Mathematics, 2001
Fair sticker languages.
Acta Inf., 2000
Trips on Trees.
Acta Cybern., 1999
Two-Way Finite State Transducers and Monadic Second-Order Logic.
Proceedings of the Automata, 1999
Forbidding and enforcing.
Proceedings of the DNA Based Computers, 1999
Tree-Walking Pebble Automata.
Proceedings of the Jewels are Forever, 1999
The Code Problem for Traces - Improving the Boundaries.
Theor. Comput. Sci., 1997
Monadic Second-Order Definable Text Languages.
Theory Comput. Syst., 1997
Text Languages in an Algebraic Framework.
Fundam. Inform., 1996
Combinatorial Properties of Dependence Graphs
Inf. Comput., November, 1994
MSO Definable Text Languages.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994
Identities and Transductions.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994
X-Automata on omega-Words.
Theor. Comput. Sci., 1993
On the Structure of Recognizable Languages of Dependence Graphs.
An Introduction to Context-free Text Grammars.
Proceedings of the Developments in Language Theory, 1993
Diamond properties of elementary net systems.
Fundam. Inform., 1991
Characterizations of the Decidability of Some Problems for Regular Trace Languages.
Mathematical Systems Theory, 1989
Automata with Storage on Infinite Words.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989
Prefix and Equality Languages of Rational Functions are Co-Context-Free.
Inf. Process. Lett., 1988
Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata.
Acta Inf., 1988
Decision Problems for Regular Trace Languages.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987
On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata.
Theor. Comput. Sci., 1986
Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma.
Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping.
Infinitary Languages: Basic Theory an Applications to Concurrent Systems.
Proceedings of the Current Trends in Concurrency, Overviews and Tutorials, 1986
On coordinated rewriting.
Proceedings of the Fundamentals of Computation Theory, 1985