| Publication | Date of Publication | Type |
|---|
Boolean algebras by length recognizability Lecture Notes in Computer Science | 2023-08-02 | Paper |
Bisimulation collapse and the process taxonomy CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
On Cayley graphs of basic algebraic structures (available as arXiv preprint) | 2020-06-11 | Paper |
| On Cayley graphs of basic algebraic structures | 2020-06-11 | Paper |
| Recognizability for automata | 2018-11-22 | Paper |
Shelah-Stupp's iteration and Muchnik's iteration Fundamenta Informaticae | 2018-05-24 | Paper |
Context-free sequences Theoretical Aspects of Computing – ICTAC 2014 | 2015-01-13 | Paper |
| Boolean algebras of unambiguous context-free languages | 2012-10-19 | Paper |
Regularity and context-freeness over word rewriting systems Foundations of Software Science and Computational Structures | 2011-05-19 | Paper |
| Deterministic graph grammars | 2011-03-30 | Paper |
An elementary bisimulation decision procedure for arbitrary context-free processes Lecture Notes in Computer Science | 2010-06-17 | Paper |
Synchronization of Regular Automata Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Synchronization of Pushdown Automata Developments in Language Theory | 2009-03-26 | Paper |
Efficient Computation of Throughput Values of Context-Free Languages Implementation and Application of Automata | 2008-06-10 | Paper |
Synchronization of Grammars Computer Science – Theory and Applications | 2008-06-05 | Paper |
Path Algorithms on Regular Graphs Fundamentals of Computation Theory | 2008-02-26 | Paper |
The Kleene Equality for Graphs Lecture Notes in Computer Science | 2007-09-05 | Paper |
| scientific article; zbMATH DE number 2102748 (Why is no real title available?) | 2004-09-24 | Paper |
On the transition graphs of Turing machines. Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1929935 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1929936 (Why is no real title available?) | 2003-06-18 | Paper |
On infinite transition graphs having a decidable monadic theory Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1738661 (Why is no real title available?) | 2002-05-07 | Paper |
| scientific article; zbMATH DE number 1512609 (Why is no real title available?) | 2001-01-17 | Paper |
| Verification on infinite structures. | 2001-01-01 | Paper |
Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\) Information and Computation | 1995-07-10 | Paper |
On the regular structure of prefix rewriting Theoretical Computer Science | 1994-02-06 | Paper |
A fast algorithm to decide on the equivalence of stateless DPDA RAIRO - Theoretical Informatics and Applications | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177434 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 139799 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 125883 (Why is no real title available?) | 1993-02-21 | Paper |
Graphes canoniques de graphes algébriques RAIRO - Theoretical Informatics and Applications | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4155910 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 3958760 (Why is no real title available?) | 1986-01-01 | Paper |