Some results on the generalized star-height problem

Jean-Eric Pin (1) , Howard Straubing (2) , Denis Thérien (3)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 BC - Boston College
3 McGill University = Université McGill [Montréal, Canada]

We prove some results related to the generalized star-height problem. In this problem, as opposed to the restricted star-height problem, complementation is considered as a basic operator. We first show that the class of languages of star-height ? n is closed under certain operations (left and right quotients, inverse alphabetic morphisms, injective star-free substitutions). It is known that languages recognized by a commutative group are of star-height 1. We extend this result to nilpotent groups of class 2 and to the groups that divide a semidirect product of a commutative group by (Z/2Z)n. In the same direction, we show that one of the languages that was conjectured to be of star height 2 during the past ten years, is in fact of star height 1. Next we show that if a rational language L is recognized by a monoid of the variety generated by wreath products of the form M o (G o N), where M and N are aperiodic monoids, and G is a commutative group, then L is of star-height ? 1. Finally we show that every rational language is the inverse image, under some morphism between free monoids, of a language of (restricted) star-height 1.

Mots clés: star-height problem; finite automata; formal languages

Domaines: Mathématique discrète [cs.DM]

Jean-Eric Pin, Howard Straubing, Denis Thérien. Some results on the generalized star-height problem. Information and Computation, 1992, 101, pp.219-250. ⟨hal-00019978⟩