Closure properties and descriptional complexity of deterministic regular expressions (Q265078)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6561942
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Closure properties and descriptional complexity of deterministic regular expressions |
scientific article; zbMATH DE number 6561942 |
Statements
Closure properties and descriptional complexity of deterministic regular expressions (English)
0 references
1 April 2016
0 references
deterministic regular expressions
0 references
one-unambiguous languages
0 references
Boolean operations
0 references
automata theory
0 references
descriptional complexity
0 references
0.9033176302909852
0 references
0.8116602301597595
0 references
0.7998353242874146
0 references
0.7746269702911377
0 references
0.7710975408554077
0 references
