| Publication | Date of Publication | Type |
|---|
Unambiguously coded shifts
European Journal of Combinatorics | 2024-06-28 | Paper |
Decidable problems in substitution shifts
Journal of Computer and System Sciences | 2024-04-09 | Paper |
Recognizability of morphisms
Ergodic Theory and Dynamical Systems | 2023-12-15 | Paper |
Fast detection of specific fragments against a set of sequences
Developments in Language Theory | 2023-11-16 | Paper |
Checking whether a word is Hamming-isometric in linear time
Theoretical Computer Science | 2022-09-27 | Paper |
| A note on one-sided recognizable morphisms | 2022-04-08 | Paper |
Symbolic dynamics
(available as arXiv preprint) | 2021-11-12 | Paper |
| Unambiguously coded shifts | 2021-03-01 | Paper |
Enumerative sequences of leaves in rational trees
Automata, Languages and Programming | 2018-07-04 | Paper |
Minimal forbidden words and symbolic dynamics
STACS 96 | 2017-11-16 | Paper |
Cyclic languages and strongly cyclic languages
STACS 96 | 2017-11-16 | Paper |
Synchronised automata
Combinatorics, Words and Symbolic Dynamics | 2017-10-06 | Paper |
| Generalized Dyck shifts | 2017-08-22 | Paper |
Periodic-Finite-Type Shift Spaces
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Shifts of \(k\)-nested sequences
Theoretical Computer Science | 2016-12-19 | Paper |
Sofic-Dyck shifts
Theoretical Computer Science | 2015-12-08 | Paper |
On the generating sequences of regular languages on \(k\) symbols
Journal of the ACM | 2015-11-12 | Paper |
Deciding proper conjugacy of classes of one-sided finite-type-Dyck shifts
Developments in Language Theory | 2015-11-10 | Paper |
Tree algebra of sofic tree languages
RAIRO - Theoretical Informatics and Applications | 2014-12-12 | Paper |
Sofic-Dyck shifts
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
A quadratic algorithm for road coloring
Discrete Applied Mathematics | 2014-05-06 | Paper |
Sofic tree-shifts
Theory of Computing Systems | 2013-12-02 | Paper |
Toward a timed theory of channel coding
Lecture Notes in Computer Science | 2012-11-21 | Paper |
Tree-shifts of finite type
Theoretical Computer Science | 2012-11-08 | Paper |
Decidability of geometricity of regular languages
Developments in Language Theory | 2012-11-02 | Paper |
Embeddings of local automata
Illinois Journal of Mathematics | 2011-04-28 | Paper |
A quadratic upper bound on the size of a synchronizing word in one-cluster automata
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
| Variable length codes and finite automata | 2011-01-03 | Paper |
Sofic and almost of finite type tree-shifts
Computer Science – Theory and Applications | 2010-06-22 | Paper |
Symbolic dynamics
(available as arXiv preprint) | 2010-06-07 | Paper |
Coding partitions of regular sets
International Journal of Algebra and Computation | 2010-02-19 | Paper |
Completing codes in a sofic shift
Theoretical Computer Science | 2009-10-09 | Paper |
Decidability of Conjugacy of Tree-Shifts of Finite Type
Automata, Languages and Programming | 2009-07-14 | Paper |
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
Developments in Language Theory | 2009-07-07 | Paper |
Presentations of Constrained Systems With Unconstrained Positions
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Unambiguous automata
Mathematics in Computer Science | 2008-09-08 | Paper |
Complete Codes in a Sofic Shift
STACS 2006 | 2008-03-19 | Paper |
Coding Partitions: Regularity, Maximality and Global Ambiguity
Developments in Language Theory | 2007-11-28 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Conjugacy and Equivalence of Weighted Automata and Functional Transducers
Computer Science – Theory and Applications | 2007-05-02 | Paper |
THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE
International Journal of Algebra and Computation | 2006-08-14 | Paper |
Codes, unambiguous automata and sofic systems.
Theoretical Computer Science | 2006-05-18 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
A hierarchy of shift equivalent sofic shifts
Theoretical Computer Science | 2005-12-06 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Codes and sofic constraints
Theoretical Computer Science | 2005-08-01 | Paper |
MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS
International Journal of Algebra and Computation | 2005-06-07 | Paper |
Extensions of the method of poles for code construction
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
Determinization of transducers over infinite words: The general case
Theory of Computing Systems | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2086415 (Why is no real title available?) | 2004-08-11 | Paper |
An algorithmic view of gene teams
Theoretical Computer Science | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 1998341 (Why is no real title available?) | 2003-10-29 | Paper |
A weak equivalence between shifts of finite type
Advances in Applied Mathematics | 2003-03-26 | Paper |
Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
Theoretical Computer Science | 2003-01-22 | Paper |
Determinization of transducers over finite and infinite words.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1714668 (Why is no real title available?) | 2002-09-11 | Paper |
| scientific article; zbMATH DE number 1670852 (Why is no real title available?) | 2001-11-11 | Paper |
Computing the prefix of an automaton
RAIRO. Theoretical Informatics and Applications | 2001-07-23 | Paper |
Computing the prefix of an automaton
RAIRO. Theoretical Informatics and Applications | 2001-07-23 | Paper |
| Asynchronous sliding block maps | 2001-04-04 | Paper |
Forbidden words in symbolic dynamics
Advances in Applied Mathematics | 2000-11-16 | Paper |
A Finite State Version of the Kraft--McMillan Theorem
SIAM Journal on Computing | 2000-10-18 | Paper |
Asynchronous sliding block maps
RAIRO - Theoretical Informatics and Applications | 2000-10-03 | Paper |
Asynchronous sliding block maps
RAIRO - Theoretical Informatics and Applications | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1512706 (Why is no real title available?) | 2000-10-03 | Paper |
Enumerative sequences of leaves and nodes in rational trees
Theoretical Computer Science | 2000-01-12 | Paper |
On the bound of the synchronization delay of a local automaton
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1189232 (Why is no real title available?) | 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
RAIRO - Theoretical Informatics and Applications | 1996-08-21 | Paper |
A note on the method of poles for code construction
IEEE Transactions on Information Theory | 1995-07-09 | Paper |
The method of poles: a coding method for constrained channels
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
Codes circulaires, automates locaux et entropie
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3978417 (Why is no real title available?) | 1986-01-01 | Paper |
