Every regular language over a finite alphabet has a generalized regular expression over that same alphabet whose Kleene-star nesting height is at most thirteen, with complement taken relative to the same free monoid.
Every regular language over a finite alphabet has a generalized regular expression over that same alphabet whose Kleene-star nesting height is at most thirteen, with complement taken relative to the same free monoid.
Every regular language over a finite alphabet has a generalized regular expression over that same alphabet whose Kleene-star nesting height is at most thirteen, with complement taken relative to the same free monoid.
If correct, establishes a universal finite bound on the generalized star height of regular languages.
Is generalized star height uniformly bounded over every finite alphabet and regular language?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
