Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Star Height Problem
CHF 29.05
Auf Lager
SKU
OIFOLTC1D0P
1 Verfügbar 
Geliefert zwischen Fr., 27.02.2026 und Mo., 02.03.2026
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 more than 2 required? If so, is there an algorithm to determine how many are required? The first question was answered in the negative when in 1963, Eggan gave examples of regular languages of star height n for every n. However, Eggan''s examples use a large alphabet, of size 2n-1 for the language with star height n. He thus asked whether we can also find examples over binary alphabets. This was proved to be true shortly afterwards by Dejean and Schützenberger (1966).
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131249914
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131249914
- Format Fachbuch
- Titel Star Height Problem
- Herausgeber Betascript Publishing
- Anzahl Seiten 72
- Genre Informatik
Bewertungen
Schreiben Sie eine Bewertung
