AbstractWe study full trios generated by commutative languages. We give, for instance, a necessary and sufficient condition for a commutative language to be erasable. This allows us to show that slip commutative languages are erasable. We prove also the existence, in the family of nonrational commutative languages, of a minimal language for rational transductions
AbstractThe ω-transductions, defined by Gire as bimorphisms, coincide with the compositions of non-e...
AbstractWe prove that the complement of a commutative languageLis context-free if the Parikh-map ofL...
Using original arguments about sets of integers satisfying some first-order formula of the Presburge...
AbstractWe study the operation of partial commutation in connection with other operations such as pa...
AbstractThe following are shown to be uniformly erasable: (i) the family of one-counter languages; a...
AbstractThe ω-transductions, defined by Gire as bimorphisms, coincide with the compositions of non-e...
AbstractThe notion of balance of two morphisms on a given language is generalized to deal with the w...
AbstractThe notion of balance of two morphisms on a given language is generalized to deal with the w...
Commutative languages with the semilinear property (SLIP) can be naturally recognized by real-time N...
AbstractA new characterization of commutative regular languages is given. Using it, it is proved tha...
AbstractThis paper deals with the scattered deletion of a language by another language, i.e. with sc...
Commutative languages with the semilinear property (SLIP) can be naturally recognized by real-time N...
International audienceThe closure of a regular language under a [partial] commutation I has been ext...
The paper is about a class of languages that extends context-free languages (CFL) and is stable unde...
AbstractLet M be a class of automata (in a precise sense to be defined) and Mc the class obtained by...
AbstractThe ω-transductions, defined by Gire as bimorphisms, coincide with the compositions of non-e...
AbstractWe prove that the complement of a commutative languageLis context-free if the Parikh-map ofL...
Using original arguments about sets of integers satisfying some first-order formula of the Presburge...
AbstractWe study the operation of partial commutation in connection with other operations such as pa...
AbstractThe following are shown to be uniformly erasable: (i) the family of one-counter languages; a...
AbstractThe ω-transductions, defined by Gire as bimorphisms, coincide with the compositions of non-e...
AbstractThe notion of balance of two morphisms on a given language is generalized to deal with the w...
AbstractThe notion of balance of two morphisms on a given language is generalized to deal with the w...
Commutative languages with the semilinear property (SLIP) can be naturally recognized by real-time N...
AbstractA new characterization of commutative regular languages is given. Using it, it is proved tha...
AbstractThis paper deals with the scattered deletion of a language by another language, i.e. with sc...
Commutative languages with the semilinear property (SLIP) can be naturally recognized by real-time N...
International audienceThe closure of a regular language under a [partial] commutation I has been ext...
The paper is about a class of languages that extends context-free languages (CFL) and is stable unde...
AbstractLet M be a class of automata (in a precise sense to be defined) and Mc the class obtained by...
AbstractThe ω-transductions, defined by Gire as bimorphisms, coincide with the compositions of non-e...
AbstractWe prove that the complement of a commutative languageLis context-free if the Parikh-map ofL...
Using original arguments about sets of integers satisfying some first-order formula of the Presburge...
DOI
Add to ORKG