publication venue for
- Computational complexity of problems for deterministic presentations of sofic shifts 2022
- On the complexity of and solutions to the minimum stopping and trapping set problems 2022
- Computational complexity of k-block conjugacy 2021
- Evolving reaction systems 2017
- Expected reachability-time games 2016
- Differentially-private learning of low dimensional manifolds 2016
- Standard and ordered zoom structures 2015
- Introducing time in reaction systems 2009
- Events and modules in reaction systems 2007
- Reducibility of gene patterns in ciliates using the breakpoint graph 2006
- The concept of computability 2004
- DNA computing by blocking 2003
- Forbidding-enforcing systems 2003
- Formal systems for gene assembly in ciliates 2003
- A guide to membrane computing 2002
- Topics in the theory of DNA computing 2002
- Gene assembly through cyclic graph decomposition 2002
- ICALP, EATCS and Maurice Nivat 2002
- Membrane systems with carriers 2002
- On representing recursively enumerable languages by internal contextual languages 1998
- A note on binary grammatical codes of trees 1996
- Characterization and complexity of uniformly nonprimitive labeled 2-structures 1996
- CLANS AND REGIONS IN 2-STRUCTURES 1994
- HYPEREDGE CHANNELS ARE ABELIAN 1994
- PROPERTIES OF GRAMMATICAL CODES OF TREES 1994
- T-STRUCTURES, T-FUNCTIONS, AND TEXTS 1993
- ANGULAR 2-STRUCTURES 1992
- PRIMITIVITY IS HEREDITARY FOR 2-STRUCTURES 1990
- THEORY OF 2-STRUCTURES .1. CLANS, BASIC SUBCLASSES, AND MORPHISMS 1990
- THEORY OF 2-STRUCTURES .2. REPRESENTATION THROUGH LABELED TREE FAMILIES 1990
- ON THE ACTIVE AND FULL USE OF MEMORY IN RIGHT-BOUNDARY GRAMMARS AND PUSH-DOWN AUTOMATA 1986
- ADDING GLOBAL FORBIDDING CONTEXT TO CONTEXT-FREE GRAMMARS 1985
- ON COORDINATED SELECTIVE SUBSTITUTIONS - TOWARDS A UNIFIED THEORY OF GRAMMARS AND MACHINES 1985
- ON INHERENTLY AMBIGUOUS E0L LANGUAGES 1984
- RESTRICTIONS ON NLC GRAPH-GRAMMARS 1984
- ON REGULARITY OF CONTEXT-FREE LANGUAGES 1983
- REPRESENTATION THEOREMS USING DOS LANGUAGES 1982
- THE (GENERALIZED) POST CORRESPONDENCE PROBLEM WITH LISTS CONSISTING OF 2 WORDS IS DECIDABLE 1982
- ON THE SUBWORD COMPLEXITY OF SQUARE-FREE D0L LANGUAGES 1981
- EVERY 2 EQUIVALENT D0L SYSTEMS HAVE A REGULAR TRUE ENVELOPE 1980
- ON A BOUND FOR THE D0L SEQUENCE EQUIVALENCE PROBLEM 1980
- ON AMBIGUITY IN E0L SYSTEMS 1980
- Computing by splicing 1995