| Publication | Date of Publication | Type |
|---|
| Unambiguously coded shifts | 2024-06-28 | Paper |
| Decidable problems in substitution shifts | 2024-04-09 | Paper |
| Recognizability of morphisms | 2023-12-15 | Paper |
| Fast detection of specific fragments against a set of sequences | 2023-11-16 | Paper |
| Checking whether a word is Hamming-isometric in linear time | 2022-09-27 | Paper |
| A note on one-sided recognizable morphisms | 2022-04-08 | Paper |
| Symbolic dynamics | 2021-11-12 | Paper |
| Unambiguously coded shifts | 2021-03-01 | Paper |
| Enumerative sequences of leaves in rational trees | 2018-07-04 | Paper |
| Cyclic languages and strongly cyclic languages | 2017-11-16 | Paper |
| Minimal forbidden words and symbolic dynamics | 2017-11-16 | Paper |
| Synchronised automata | 2017-10-06 | Paper |
| Generalized Dyck shifts | 2017-08-22 | Paper |
| Periodic-Finite-Type Shift Spaces | 2017-07-12 | Paper |
| Shifts of \(k\)-nested sequences | 2016-12-19 | Paper |
| Sofic-Dyck shifts | 2015-12-08 | Paper |
| On the generating sequences of regular languages on k symbols | 2015-11-12 | Paper |
| Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts | 2015-11-10 | Paper |
| Tree algebra of sofic tree languages | 2014-12-12 | Paper |
| Sofic-Dyck Shifts | 2014-10-14 | Paper |
| A quadratic algorithm for road coloring | 2014-05-06 | Paper |
| Sofic tree-shifts | 2013-12-02 | Paper |
| Toward a Timed Theory of Channel Coding | 2012-11-21 | Paper |
| Tree-shifts of finite type | 2012-11-08 | Paper |
| Decidability of Geometricity of Regular Languages | 2012-11-02 | Paper |
| Embeddings of local automata | 2011-04-28 | Paper |
| A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA | 2011-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3062121 | 2011-01-03 | Paper |
| Sofic and Almost of Finite Type Tree-Shifts | 2010-06-22 | Paper |
| Symbolic dynamics | 2010-06-07 | Paper |
| CODING PARTITIONS OF REGULAR SETS | 2010-02-19 | Paper |
| Completing codes in a sofic shift | 2009-10-09 | Paper |
| Decidability of Conjugacy of Tree-Shifts of Finite Type | 2009-07-14 | Paper |
| A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata | 2009-07-07 | Paper |
| Presentations of Constrained Systems With Unconstrained Positions | 2008-12-21 | Paper |
| Unambiguous automata | 2008-09-08 | Paper |
| Complete Codes in a Sofic Shift | 2008-03-19 | Paper |
| Coding Partitions: Regularity, Maximality and Global Ambiguity | 2007-11-28 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Conjugacy and Equivalence of Weighted Automata and Functional Transducers | 2007-05-02 | Paper |
| THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE | 2006-08-14 | Paper |
| Codes, unambiguous automata and sofic systems. | 2006-05-18 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| A hierarchy of shift equivalent sofic shifts | 2005-12-06 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Codes and sofic constraints | 2005-08-01 | Paper |
| MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS | 2005-06-07 | Paper |
| Extensions of the method of poles for code construction | 2005-06-01 | Paper |
| Determinization of transducers over infinite words: The general case | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736870 | 2004-08-11 | Paper |
| An algorithmic view of gene teams | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432976 | 2003-10-29 | Paper |
| A weak equivalence between shifts of finite type | 2003-03-26 | Paper |
| Squaring transducers: An efficient procedure for deciding functionality and sequentiality. | 2003-01-22 | Paper |
| Determinization of transducers over finite and infinite words. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776539 | 2002-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754176 | 2001-11-11 | Paper |
| Computing the prefix of an automaton | 2001-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708950 | 2001-04-04 | Paper |
| Forbidden words in symbolic dynamics | 2000-11-16 | Paper |
| A Finite State Version of the Kraft--McMillan Theorem | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508395 | 2000-10-03 | Paper |
| Asynchronous sliding block maps | 2000-10-03 | Paper |
| Enumerative sequences of leaves and nodes in rational trees | 2000-01-12 | Paper |
| On the bound of the synchronization delay of a local automaton | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838997 | 1998-10-08 | Paper |
| Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique | 1996-08-21 | Paper |
| A note on the method of poles for code construction | 1995-07-09 | Paper |
| The method of poles: a coding method for constrained channels | 1990-01-01 | Paper |
| Codes circulaires, automates locaux et entropie | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742743 | 1986-01-01 | Paper |
