2022
On rationally controlled one-rule insertion systems.
RAIRO Theor. Informatics Appl., 2022
2019
On prefixal one-rule string rewrite systems.
Theor. Comput. Sci., 2019
2015
A canonical automaton for one-rule length-preserving string rewrite systems.
Inf. Comput., 2015
2014
One-Rule Length-Preserving Rewrite Systems and Rational Transductions.
RAIRO Theor. Informatics Appl., 2014
2012
On One-Rule Grid Semi-Thue Systems.
Fundam. Informaticae, 2012
2009
Minimal NFA and biRFSA Languages.
RAIRO Theor. Informatics Appl., 2009
2007
Extension of the decidability of the marked PCP to instances with unique blocks.
Theor. Comput. Sci., 2007
2006
Identification of biRFSA languages.
Theor. Comput. Sci., 2006
2005
Theor. Comput. Sci., 2005
Theor. Comput. Sci., 2005
Commutation with Ternary Sets of Words.
Theory Comput. Syst., 2005
Equality sets for recursively enumerable languages.
RAIRO Theor. Informatics Appl., 2005
Equality sets of prefix morphisms and regular star languages.
Inf. Process. Lett., 2005
Representation of Regular Languages by Equality Sets.
Bull. EATCS, 2005
2004
Valence Languages Generated by Equality Sets.
J. Autom. Lang. Comb., 2004
2003
The Commutation with Codes and Ternary Sets of Words.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
Languages Defined by Generalized Equality Sets.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003
1999
Synchronized Shuffle and Regular Languages.
Proceedings of the Jewels are Forever, 1999
1998
The Meet Operation in the Lattice of Codes.
Theor. Comput. Sci., 1998
Iterated Length-Preserving Rational Transductions.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
1997
Recognizable Picture Languages and Domino Tiling.
Theor. Comput. Sci., 1997
Context-Sensitive String Languages and Eecognizable Picture Languages.
Inf. Comput., 1997
Constructing Sequential Bijections.
Proceedings of the Structures in Logic and Computer Science, 1997
1996
On Computational Power of Weighted Finite Automata.
Fundam. Informaticae, 1996
Variable-Length Maximal Codes.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996
1995
Proceedings of the Book of Traces, 1995
1994
Representation of Rational Functions with Prefix and Suffix Codings.
Theor. Comput. Sci., 1994
On Continuous Functions Computed by Finite Automata.
RAIRO Theor. Informatics Appl., 1994
Codes and Infinite Words.
Acta Cybern., 1994
1992
Compositional representation of rational functions.
RAIRO Theor. Informatics Appl., 1992
Deterministic Sequential Functions.
Acta Informatica, 1992
A Decidability Result about Convex Polyominoes.
Proceedings of the LATIN '92, 1992
1990
On Characterizations of Recursively Enumerable Languages.
Acta Informatica, 1990
Rational omega-Transductions.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990
Decomposition of Partial Commutations.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990
1989
Motifs Et Bases De Langages.
RAIRO Theor. Informatics Appl., 1989
1988
Theor. Comput. Sci., 1988
Bifaithful Starry Transductions.
Inf. Process. Lett., 1988
Rational Cones and Commutations.
Proceedings of the Machines, 1988
1987
Inf. Comput., April, 1987
A New Normal Form for the Compositions of Morphisms and Inverse Morphisms.
Math. Syst. Theory, 1987
On Commutative Context-Free Languages.
J. Comput. Syst. Sci., 1987
Sur Les Ensembles Linéaires.
RAIRO Theor. Informatics Appl., 1987
1986
Two Characterizations of Rational Adherences.
Theor. Comput. Sci., 1986
Finitely Generated (Omega)o-Languages.
Inf. Process. Lett., 1986
1985
On the Usefulness of Bifaithful Rational Cones.
Math. Syst. Theory, 1985
The Family of One-Counter Languages is Closed Under Quotient.
Acta Informatica, 1985
1984
Partial Commutations and Faithful Rational Transductions.
Theor. Comput. Sci., 1984
Commutative One-Counter Languages are Regular.
J. Comput. Syst. Sci., 1984
On Bounded Context-free Languages.
J. Inf. Process. Cybern., 1984
1983
J. Comput. Syst. Sci., 1983
On a Language Without Star.
Inf. Process. Lett., 1983
On the Composition of Morphisms and Inverse Morphisms.
Proceedings of the Automata, 1983
1982
Indécidabilité de la Condition IRS.
RAIRO Theor. Informatics Appl., 1982
Substitution of Bounded Rational Cone
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982
1981
Languages albébriques dominés par des langages unaires
Inf. Control., January, 1981
A Propos du Lemme de Substitution.
Theor. Comput. Sci., 1981
The Inclusion of D0L in MULTI-RESET.
Inf. Process. Lett., 1981
Quelques propriétés des langages à un Comptuer.
Proceedings of the Theoretical Computer Science, 1981
Parikh-Bounded Languages.
Proceedings of the Automata, 1981
1980
Transduction rationnelle, substitution et complémentaire
Inf. Control., June, 1980
Sur les générateurs algébriques et linéaires.
Acta Informatica, 1980
1979
Substitutions dans le EDTOL Systèmes Ultralinéaires
Inf. Control., August, 1979
A New Proof of two Theorems about Rational Transductions.
Theor. Comput. Sci., 1979
Cônes rationnels commutatifs.
J. Comput. Syst. Sci., 1979
Intersections de langages algébriques bornés.
Acta Informatica, 1979
Sur deux langages linéaires.
Proceedings of the Theoretical Computer Science, 1979
Une propriete de la famille GRE.
Proceedings of the Fundamentals of Computation Theory, 1979
1978
Une Note sur la Propriété de Prefixe.
Math. Syst. Theory, 1978
Mots infinis et langages commutatifs.
RAIRO Theor. Informatics Appl., 1978
1977
Produit dans le Cône Rationnel Engendré par <i>D</i>.
Theor. Comput. Sci., 1977
Cônes Rationnels Commutativement Clos.
RAIRO Theor. Informatics Appl., 1977
Problems decidables concernant les tol-langages unaires.
Discret. Math., 1977
1975
Sur les TOL - Systemes Unaires.
RAIRO Theor. Informatics Appl., 1975
