Hendrik Jan Hoogeboom

CoRR, 2022

2021

Comparing reactions in reaction systems.

[BibT_eX]

[DOI]

Jetty Kleijn

Theor. Comput. Sci., 2021

XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles.

[BibT_eX]

[DOI]

Bart Samwel

Theor. Comput. Sci., 2021

2020

Extracting reaction systems from function behavior.

[BibT_eX]

[DOI]

Zornitza Genova Prodanoff

J. Membr. Comput., 2020

Companions and an Essential Motion of a Reaction System.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

Counterexamples to a conjecture of Las Vergnas.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

2019

Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute.

[BibT_eX]

[DOI]

Jérôme Durand-Lose

CoRR, 2019

2017

A graph isomorphism condition and equivalence of reaction systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Enforcing Regular Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Finite Language Forbidding-Enforcing Systems.

[BibT_eX]

[DOI]

Proceedings of the Unveiling Dynamics and Complexity, 2017

2014

The Algebra of Gene Assembly in Ciliates.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Topological Models in Molecular Biology, 2014

Acyclic Constraint Logic and Games.

[BibT_eX]

[DOI]

Jan N. van Rijn

Jonathan K. Vis

J. Int. Comput. Games Assoc., 2014

Interlace polynomials for multimatroids and delta-matroids.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Graph Polynomials Motivated by Gene Rearrangements in Ciliates.

[BibT_eX]

[DOI]

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013

Nullity and Loop Complementation for Delta-Matroids.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

A Minimal Normal Form for DNA Expressions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

Making DNA Expressions Minimal.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

The Adjacency Matroid of a Graph.

[BibT_eX]

[DOI]

Lorenzo Traldi

Electron. J. Comb., 2013

2012

Pivots, determinants, and perfect matchings of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Preface.

[BibT_eX]

[DOI]

Giorgio Ausiello

Juhani Karhumäki

Ion Petre

Arto Salomaa

Theor. Comput. Sci., 2012

Spiking Neural P Systems with Astrocytes.

[BibT_eX]

[DOI]

Neural Comput., 2012

Binary Symmetric Matrix Inversion Through Local Complementation.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

2011

On aggregation in multiset-based self-assembly of graphs.

[BibT_eX]

[DOI]

Nat. Comput., 2011

P Systems and Topology: Some Suggestions for Research.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Limited Asynchronous Spiking Neural P Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

The group structure of pivot and loop complementation on graphs and set systems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

Asynchronous Extended Spiking Neural P Systems with Astrocytes.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2011

2010

Combining overlap and containment for gene assembly in ciliates.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Spiking Neural P Systems with Weights.

[BibT_eX]

[DOI]

Gheorghe Paun

Mario J. Pérez-Jiménez

Neural Comput., 2010

Maximal pivots on graphs with an application to gene assembly.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Pivot and Loop Complementation on Graphs and Set Systems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Spiking Neural P Systems with Neuron Division.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2010

2009

Perfectly quilted rectangular snake tilings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

Nullity Invariance for Pivot and the Interlace Polynomial

[BibT_eX]

[DOI]

CoRR, 2009

Automata Walking over Trees and Graphs.

[BibT_eX]

Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

Reality-and-Desire in Ciliates.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Bioprocesses, 2009

2008

Selection of DNA Markers.

[BibT_eX]

[DOI]

Jeroen F. J. Laros

IEEE Trans. Syst. Man Cybern. Part C, 2008

Strategies of loop recombination in ciliates.

[BibT_eX]

[DOI]

Michael Muskulus

Discret. Appl. Math., 2008

The fibers and range of reduction graphs in ciliates.

[BibT_eX]

[DOI]

Acta Informatica, 2008

Extending the Overlap Graph for Gene Assembly in Ciliates.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

2007

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

P Systems with Single passenger Carriers.

[BibT_eX]

[DOI]

Yan Gao

Int. J. Found. Comput. Sci., 2007

Finitary Compositions of Two-way Finite-State Transductions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

How Overlap Determines the Macronuclear Genes in Ciliates

[BibT_eX]

[DOI]

CoRR, 2007

XML transformation by tree-walking transducers with invisible pebbles.

[BibT_eX]

[DOI]

Bart Samwel

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).

[BibT_eX]

[DOI]

André H. Deutz

Proceedings of the Fun with Algorithms, 4th International Conference, 2007

From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Characterizing Reduction Graphs for Gene Assembly in Ciliates.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Reducibility of gene patterns in ciliates using the breakpoint graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

The Construction of Minimal DNA Expressions.

[BibT_eX]

[DOI]

Nat. Comput., 2006

Nested Pebbles and Transitive Closure.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

Computing by Only Observing.

[BibT_eX]

[DOI]

Matteo Cavaliere

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

Applicability of Loop Recombination in Ciliates Using the Breakpoint Graph.

[BibT_eX]

[DOI]

Michael Muskulus

Proceedings of the Computational Life Sciences II, 2006

2005

Equality sets for recursively enumerable languages.

[BibT_eX]

[DOI]

Vesa Halava

Michel Latteux

RAIRO Theor. Informatics Appl., 2005

The Breakpoint Graph in Ciliates.

[BibT_eX]

[DOI]

Proceedings of the Computational Life Sciences, First International Symposium, 2005

2004

Valence Languages Generated by Equality Sets.

[BibT_eX]

[DOI]

Vesa Halava

Michel Latteux

J. Autom. Lang. Comb., 2004

Tetris and decidability.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

How to Construct Tetris Configurations.

[BibT_eX]

[DOI]

Int. J. Intell. Games Simul., 2004

Tetris is hard, even to approximate.

[BibT_eX]

[DOI]

Ron Breukelaar

Erik D. Demaine

Susan Hohenberger

David Liben-Nowell

Int. J. Comput. Geom. Appl., 2004

P systems with symport/antiport simulating counter automata.

[BibT_eX]

[DOI]

Acta Informatica, 2004

Combinatorial Aspects of Minimal DNA Expressions.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

2003

Languages Defined by Generalized Equality Sets.

[BibT_eX]

[DOI]

Vesa Halava

Michel Latteux

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

A Direct Construction of a Universal P System.

[BibT_eX]

[DOI]

Paul Sant

Fundam. Informaticae, 2002

Simulating Counter Automata by P Systems with Symport/Antiport.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, International Workshop, 2002

Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Upper Bounds for Restricted Splicing.

[BibT_eX]

[DOI]

Proceedings of the Formal and Natural Computing, 2002

2001

MSO definable string transductions and two-way finite-state transducers.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2001

Sequences of languages in forbidding-enforcing families.

[BibT_eX]

[DOI]

Soft Comput., 2001

Context-Free Valence Grammars - Revisited.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

A characterization of non-iterated splicing with regular rules.

[BibT_eX]

Ray Dassen

Proceedings of the Where Mathematics, 2001

2000

Fair sticker languages.

[BibT_eX]

[DOI]

Acta Informatica, 2000

1999

Trips on Trees.

[BibT_eX]

[DOI]

Jan-Pascal van Best

Acta Cybern., 1999

Two-Way Finite State Transducers and Monadic Second-Order Logic.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

Forbidding and enforcing.

[BibT_eX]

[DOI]

Proceedings of the DNA Based Computers, 1999

Tree-Walking Pebble Automata.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1997

The Code Problem for Traces - Improving the Boundaries.

[BibT_eX]

[DOI]

Anca Muscholl

Theor. Comput. Sci., 1997

Monadic Second-Order Definable Text Languages.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1997

1996

Text Languages in an Algebraic Framework.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

1995

Dependence Graphs.

[BibT_eX]

[DOI]

Proceedings of the Book of Traces, 1995

1994

Combinatorial Properties of Dependence Graphs

[BibT_eX]

[DOI]

Inf. Comput., November, 1994

MSO Definable Text Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Identities and Transductions.

[BibT_eX]

[DOI]

H. C. M. Kleijn

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993

X-Automata on omega-Words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

On the Structure of Recognizable Languages of Dependence Graphs.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1993

An Introduction to Context-free Text Grammars.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

1991

Diamond properties of elementary net systems.

[BibT_eX]

Fundam. Informaticae, 1991

1989

Characterizations of the Decidability of Some Problems for Regular Trace Languages.

[BibT_eX]

[DOI]

IJsbrand Jan Aalbersberg

Math. Syst. Theory, 1989

Automata with Storage on Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988

Prefix and Equality Languages of Rational Functions are Co-Context-Free.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata.

[BibT_eX]

[DOI]

Acta Informatica, 1988

1987

Decision Problems for Regular Trace Languages.

[BibT_eX]

[DOI]

IJsbrand Jan Aalbersberg

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1986

Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1986

Infinitary Languages: Basic Theory an Applications to Concurrent Systems.

[BibT_eX]

[DOI]

Proceedings of the Current Trends in Concurrency, Overviews and Tutorials, 1986

1985

On coordinated rewriting.

[BibT_eX]

[DOI]