Given a family of recognizable languages L1, . . . ,Lm and recognizable languages K1 ⊆ K2, the relative inclusion star height problem means to compute the minimal star height of some rational expression r over L1, . . . ,Lm satisfying K1 ⊆ L(r) ⊆ K2. We show that this problem is of elementary complexity and give a detailed analysis its complexity depending on the representation of K1 and K2 and whether L1, . . . ,Lm are singletons.
Freie Schlagwörter (EN)
recognizable sets, star height, distance desert automata