Marie-Pierre Béal

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

2022

Checking whether a word is Hamming-isometric in linear time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

2021

Decidable problems in substitution shifts.

[BibT_eX]

[DOI]

CoRR, 2021

Recognizability of morphisms.

[BibT_eX]

[DOI]

CoRR, 2021

Unambiguously coded systems.

[BibT_eX]

[DOI]

CoRR, 2021

Symbolic dynamics.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Automata Theory., 2021

2017

Shifts of k-nested sequences.

[BibT_eX]

[DOI]

Pavel Heller

Theor. Comput. Sci., 2017

Generalized Dyck Shifts.

[BibT_eX]

[DOI]

Pavel Heller

Proceedings of the Computer Science - Theory and Applications, 2017

2016

Sofic-Dyck shifts.

[BibT_eX]

[DOI]

Michel Blockelet

Catalin Dima

Theor. Comput. Sci., 2016

2015

Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts.

[BibT_eX]

[DOI]

Pavel Heller

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014

Tree algebra of sofic tree languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2014

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

A quadratic algorithm for road coloring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Zeta functions of finite-type-Dyck shifts are N-algebraic.

[BibT_eX]

[DOI]

Michel Blockelet

Catalin Dima

Proceedings of the 2014 Information Theory and Applications Workshop, 2014

2013

Sofic Tree-Shifts.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Finite-type-Dyck shift spaces.

[BibT_eX]

[DOI]

Michel Blockelet

Catalin Dima

CoRR, 2013

2012

Tree-shifts of finite type.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Toward a Timed Theory of Channel Coding.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2012

Decidability of Geometricity of Regular Languages.

[BibT_eX]

[DOI]

Jean-Marc Champarnaud

Jean-Philippe Dubernard

Hadrien Jeanne

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Periodic-Finite-Type Shift Spaces.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata.

[BibT_eX]

[DOI]

Mikhail V. Berlinkov

Int. J. Found. Comput. Sci., 2011

2010

Symbolic dynamics

[BibT_eX]

[DOI]

CoRR, 2010

Sofic and Almost of Finite Type Tree-Shifts.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2010

2009

Completing codes in a sofic shift.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Coding Partitions of Regular Sets.

[BibT_eX]

[DOI]

Fabio Burderi

Int. J. Algebra Comput., 2009

Decidability of Conjugacy of Tree-Shifts of Finite Type.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

Unambiguous Automata.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2008

Embeddings of local automata.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Minimizing local automata.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Coding Partitions: Regularity, Maximality and Global Ambiguity.

[BibT_eX]

[DOI]

Fabio Burderi

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Codes, unambiguous automata and sofic systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2006

Complete Codes in a Sofic Shift.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

Conjugacy and Equivalence of Weighted Automata and Functional Transducers.

[BibT_eX]

[DOI]

Jacques Sakarovitch

Proceedings of the Computer Science, 2006

2005

Presentations of constrained systems with unconstrained positions.

[BibT_eX]

[DOI]

Gabriele Fici

IEEE Trans. Inf. Theory, 2005

Codes and sofic constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A hierarchy of shift equivalent sofic shifts.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Minimal Forbidden Patterns of Multi-Dimensional Shifts.

[BibT_eX]

[DOI]

Filippo Mignosi

Int. J. Algebra Comput., 2005

On the Equivalence of -Automata.

[BibT_eX]

[DOI]

Jacques Sakarovitch

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

An algorithmic view of gene teams.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Determinization of Transducers over Infinite Words: The General Case.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2004

The Syntactic Graph of a Sofic Shift.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

A Hierarchy of Irreducible Sofic Shifts.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

Extensions of the method of poles for code construction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Squaring transducers: an efficient procedure for deciding functionality and sequentiality.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On the generating sequences of regular languages on <i>k</i> symbols.

[BibT_eX]

[DOI]

J. ACM, 2003

Computing forbidden words of regular languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

2002

Determinization of transducers over finite and infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

A weak equivalence between shifts of finite type.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2002

On the Enumerative Sequences of Regular Languages on k Symbols.

[BibT_eX]

[DOI]

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

2000

A Finite State Version of the Kraft--McMillan Theorem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Computing the prefix of an automaton.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2000

Asynchronous sliding block maps.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2000

Forbidden Words in Symbolic Dynamics.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2000

Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Determinization of Transducers over Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

Enumerative Sequences of Leaves and Nodes in Rational Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

1998

On the Bound of the Synchronization Delay of a Local Automaton.

[BibT_eX]

[DOI]

Jean Senellart

Theor. Comput. Sci., 1998

Super-State Automata and Rational Trees.

[BibT_eX]

[DOI]

Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997

Symbolic Dynamics and Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, 1997

Enumerative Sequences of Leaves in Rational Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Minimal Forbidden Words and Symbolic Dynamics.

[BibT_eX]

[DOI]

Filippo Mignosi

Proceedings of the STACS 96, 1996

Cyclic Languages and Strongly Cyclic Languages.

[BibT_eX]

[DOI]

Christophe Reutenauer

Proceedings of the STACS 96, 1996

1995

Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1995

1994

A note on the method of poles for code construction.

[BibT_eX]

[DOI]

Jonathan J. Ashley

IEEE Trans. Inf. Theory, 1994

1990

The method of poles: A coding method for constrained channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

1988

Codes Circulaires, Automates Locaux et Entropie.

[BibT_eX]

[DOI]