The complexity of regular(-like) expressions (Q2909093)
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 6073863
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of regular(-like) expressions |
scientific article; zbMATH DE number 6073863 |
Statements
29 August 2012
0 references
regular expressions
0 references
finite automata
0 references
transformations
0 references
descriptional complexity
0 references
computational complexity
0 references
formal language problems
0 references
operation problems
0 references
0 references
0 references
0 references
0 references
0 references
0.8932243
0 references
0.8914884
0 references
0.88293636
0 references
0.87843555
0 references
0.87693024
0 references
0.8647074
0 references
0.8647074
0 references
The complexity of regular(-like) expressions (English)
0 references
