Star height problem
The star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limited star height, i.e. with a limited nesting depth of Kleene stars. Specifically, is a nesting depth of one always sufficient? If not, is there an algorithm to determine how many are required? The problem was raised by .
Link from a Wikipage to another Wikipage
primaryTopic
Star height problem
The star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limited star height, i.e. with a limited nesting depth of Kleene stars. Specifically, is a nesting depth of one always sufficient? If not, is there an algorithm to determine how many are required? The problem was raised by .
has abstract
Le problème de la hauteur d'ét ...... décidable, est très difficile.
@fr
O problema da altura da estrel ...... O problema foi levantado por .
@pt
The star height problem in for ...... d? The problem was raised by .
@en
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
996,576,335
Link from a Wikipage to another Wikipage
date
September 2020
@en
reason
Parenthetical referencing has been deprecated; convert to shortened footnotes.
@en
wikiPageUsesTemplate
hypernym
type
comment
Le problème de la hauteur d'ét ...... décidable, est très difficile.
@fr
O problema da altura da estrel ...... O problema foi levantado por .
@pt
The star height problem in for ...... d? The problem was raised by .
@en
label
Problema da altura da estrela
@pt
Problème de la hauteur d'étoile
@fr
Star height problem
@en