0000000001242627

AUTHOR

R. Montalbano

showing 1 related works from this author

The Star Height One Problem for Irreducible Automata

1993

The star height of a regular expression is, informally, the maximum number of nested stars in the expression. The star height of a regular language is the minimal star height of a regular expression denoting this language. The notion of star height indicates in a certain sense the “loop complexity” of a regular expression and thus it gives a measure of the complexity of a regular language.

Discrete mathematicsStar heightAstrophysics::Cosmology and Extragalactic AstrophysicsExpression (computer science)Measure (mathematics)AutomatonLoop (topology)StarsRegular languageAstrophysics::Solar and Stellar AstrophysicsAstrophysics::Earth and Planetary AstrophysicsRegular expressionArithmeticAstrophysics::Galaxy AstrophysicsMathematics
researchProduct