Extended automata-like regular expressions of star degree at most (2,1) (Q808718)
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 automata-like regular expressions of star degree at most (2,1) |
scientific article; zbMATH DE number 4211522
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extended automata-like regular expressions of star degree at most (2,1) |
scientific article; zbMATH DE number 4211522 |
Statements
Extended automata-like regular expressions of star degree at most (2,1) (English)
0 references
1991
0 references
extended regular languages
0 references
linearly nested context-free languages
0 references
closure of the family of finite languages
0 references
ultralinear languages
0 references
0.8946629762649536
0 references
0.8481928110122681
0 references
0.7957826256752014
0 references
0.7403454780578613
0 references
0.7348118424415588
0 references
