| Representing reaction systems by trees | 2 | 0.39 | 2012 |
| Introducing time in reaction systems | 20 | 1.21 | 2009 |
| Modeling Interactions between Biochemical Reactions | 0 | 0.34 | 2008 |
| Reaction Systems | 20 | 3.58 | 2007 |
| Events and modules in reaction systems | 35 | 4.60 | 2007 |
| Computational nature of biochemical reactions | 0 | 0.34 | 2006 |
| Basic notions of reaction systems | 14 | 4.57 | 2004 |
| Forbidding-enforcing systems | 12 | 2.75 | 2003 |
| Gene assembly through cyclic graph decomposition | 11 | 1.18 | 2002 |
| Permutations, parenthesis words, and Schro¨der numbers | 5 | 0.52 | 1998 |
| Semantics of nonsequential tree-based computation schemes | 0 | 0.34 | 1997 |
| 2-structures—a framework for decomposition and transformation of graphs | 4 | 0.96 | 1997 |
| Invariants of inversive 2-structures on groups of labels | 0 | 0.34 | 1997 |
| Square Systems | 0 | 0.34 | 1994 |
| Clans and regions in 2-structures | 2 | 0.44 | 1994 |
| Properties of grammatical codes of trees | 3 | 0.79 | 1994 |
| Hyperedge channels are abelian | 0 | 0.34 | 1994 |
| Context-free text grammars | 5 | 0.50 | 1994 |
| Incremental construction of 2-structures | 0 | 0.34 | 1994 |
| Combinatorial properties of dependence graphs | 1 | 0.36 | 1994 |
| Semantics of trees | 1 | 0.40 | 1994 |
| A k-structure generalization of the theory of 2-structures | 11 | 1.46 | 1994 |
| T-structures, T-functions, and texts. | 9 | 0.74 | 1993 |
| Angular 2–structures | 11 | 1.12 | 1992 |
| Grammatical codes of trees | 3 | 0.62 | 1991 |
| Primitivity is hereditary for 2-structures | 29 | 2.93 | 1990 |
| Theory of 2-structures. Part II: representation through labeled tree families | 27 | 3.07 | 1990 |
| A characterization of set representable labeled partial 2-structures through decompositions | 0 | 0.34 | 1990 |
| Theory of 2-structures. Part I: clans, basic subclasses, and morphisms | 38 | 5.44 | 1990 |
| Partial (set) 2-structures. Part I: basic notions and the representation problem | 138 | 14.67 | 1989 |
| Learnability and the Vapnik-Chervonenkis dimension | 793 | 307.26 | 1989 |
| Partial (set) 2-structures. Part II: state spaces of concurrent systems | 65 | 5.33 | 1989 |
| Recording the use of memory in right-boundary grammars and push-down automata | 0 | 0.34 | 1988 |
| A new distance metric on strings computable in linear time | 16 | 6.31 | 1988 |
| Learning decision trees from random examples | 64 | 28.73 | 1988 |
| Complete inverted files for efficient text retrieval and analysis | 112 | 10.96 | 1987 |
| Addendum to the paper “On the dependence of functions on their variables” | 1 | 0.63 | 1986 |
| On the active and full use of memory in right-boundary grammars and push-down automata | 1 | 0.48 | 1986 |
| On total regulators generated by derivation relations | 10 | 0.93 | 1985 |
| The Smallest Automation Recognizing The Subwords Of A Text | 72 | 18.70 | 1985 |
| Adding Global Forbidding Context To Context-Free Grammars | 1 | 0.36 | 1985 |
| A Morphic Representation Of Eol Languages And Other Etol Languages | 2 | 0.40 | 1985 |
| On Regularity Of Languages Generated By Copying Systems | 10 | 1.59 | 1984 |
| A New Method Of Proving Theorems On Chromatic Index | 13 | 2.58 | 1984 |
| Building a complete inverted file for a set of text files in linear time | 9 | 4.72 | 1984 |
| On Inherently Ambiguous E0l Languages | 0 | 0.34 | 1984 |
| Context Free Normal Systems and ETOL Systems | 0 | 0.34 | 1983 |
| Repetition of subwords in DOL languages | 16 | 1.38 | 1983 |
| On regularity of context-free languages | 59 | 4.55 | 1983 |
| Representation Theorems Using Dos Languages | 0 | 0.34 | 1982 |
