Algorithms for determining relative star height and star height
Information and Computation
Algorithms for determining relative inclusion star height and inclusion
Theoretical Computer Science
Handbook of formal languages, vol. 1
Automata, Languages, and Machines
Automata, Languages, and Machines
Limited subsets of a free monoid
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The Theory of Stabilisation Monoids and Regular Cost Functions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Elements of Automata Theory
Star height of certain families of regular events
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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 an analysis of its complexity.