Generalized star-height problem
id:
generalized-star-height-problem-321-9543642
title:
Generalized star-height problem
text:
The generalized star-height problem in formal language theory is the open question whether all regular languages can be expressed using generalized regular expressions with a limited nesting depth of Kleene stars. Here, generalized regular expressions are defined like regular expressions, but they have a built-in complement operator. For a regular language, its generalized star height is defined as the minimum nesting depth of Kleene stars needed in order to describe the language by means of a g
brand slug:
wiki
category slug:
encyclopedia
description:
Unsolved problem in formal language theory
original url:
https://en.wikipedia.org/wiki/Generalized_star-height_problem
date created:
date modified:
2022-12-12T14:52:55Z
main entity:
{"identifier":"Q5532516","url":"https://www.wikidata.org/entity/Q5532516"}
image:
fields total:
13
integrity:
14