| Boolean Algebras by Length Recognizability. | 0 | 0.34 | 2018 |
| Recognizability for Automata. | 0 | 0.34 | 2018 |
| Shelah-Stupp's Iteration and Muchnik's Iteration. | 0 | 0.34 | 2018 |
| Structural characterization of Cayley graphs. | 0 | 0.34 | 2016 |
| Higher order indexed monadic systems. | 0 | 0.34 | 2011 |
| Regularity and context-freeness over word rewriting systems | 1 | 0.37 | 2011 |
| Synchronization of Regular Automata | 3 | 0.42 | 2009 |
| Synchronization of Grammars | 7 | 0.52 | 2008 |
| Deterministic graph grammars | 12 | 0.62 | 2008 |
| Boolean algebras of unambiguous context-free languages | 5 | 0.53 | 2008 |
| Efficient computation of throughput values of context-free languages | 3 | 0.45 | 2007 |
| Path algorithms on regular graphs | 1 | 0.44 | 2007 |
| The kleene equality for graphs | 1 | 0.36 | 2006 |
| On the transition graphs of Turing machines | 12 | 1.27 | 2003 |
| On infinite transition graphs having a decidable monadic theory | 97 | 5.39 | 2003 |
| A Chomsky-Like Hierarchy of Infinite Graphs | 5 | 0.53 | 2002 |
| On Infinite Terms Having a Decidable Monadic Theory | 60 | 2.48 | 2002 |
| An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs | 6 | 0.61 | 2001 |
| On Word Rewriting Systems Having a Rational Derivation | 8 | 0.73 | 2000 |
| Bisimulation Collapse and the Process Taxonomy | 33 | 1.68 | 1996 |
| Deciding branching bisimilarity of normed context-free processes is in &Sgr;2p | 2 | 0.37 | 1995 |
| An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes | 42 | 1.83 | 1995 |
| A Fast Algorithm to Decide on the Equivalence of Stateless DPDA | 7 | 1.21 | 1993 |
| Branching Bisimulation for Context-free Processes | 2 | 0.39 | 1992 |
| On the regular structure of prefix rewriting | 96 | 6.67 | 1992 |
| On the transition graphs of automata and grammars | 19 | 3.00 | 1990 |
| An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes | 0 | 0.34 | 1990 |
| Graphes canoniques de graphes algébriques | 41 | 5.75 | 1990 |
| A Fast Algorithm to Decide on Simple Grammars Equivalence | 7 | 1.15 | 1989 |
| Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples | 0 | 0.34 | 1986 |
