Extended regular expressions of star degree at most two (Q921911)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extended regular expressions of star degree at most two |
scientific article; zbMATH DE number 4166863
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extended regular expressions of star degree at most two |
scientific article; zbMATH DE number 4166863 |
Statements
Extended regular expressions of star degree at most two (English)
0 references
1990
0 references
The paper introduces the star operator of degree two, a generalization of Kleene star in regular expressions. One investigates the family of languages obtained by a finite number of operations of union, concatenation, Kleene star and star operator of degree two, starting from finite languages. This family is incomparable with those of linear languages and of deterministic context-free languages, and it is equal to the family of completely linearly nested context-free languages. Closure and decision properties of this family are examined, too.
0 references
star operator
0 references
Kleene star
0 references
finite languages
0 references
context-free languages
0 references
0.95486695
0 references
0.92986035
0 references
0 references
0.82964694
0 references
0.82867074
0 references
0.8108647
0 references
0.8108647
0 references
0.80737245
0 references
