From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411)
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 6569397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From finite automata to regular expressions and back -- a summary on descriptional complexity |
scientific article; zbMATH DE number 6569397 |
Statements
15 April 2016
0 references
finite automata
0 references
regular expressions
0 references
descriptional complexity
0 references
upper bounds
0 references
lower bounds
0 references
0 references
0 references
0 references
0 references
0 references
0 references
From finite automata to regular expressions and back -- a summary on descriptional complexity (English)
0 references
0.9917615652084352
0 references
0.8468577265739441
0 references
0.8391578793525696
0 references
0.8382541537284851
0 references
