Provably shorter regular expressions from finite automata (Q5168416)
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 6313574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Provably shorter regular expressions from finite automata |
scientific article; zbMATH DE number 6313574 |
Statements
PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (English)
0 references
4 July 2014
0 references
regular expression
0 references
state elimination
0 references
cycle rank
0 references
intersection
0 references
interleaving
0 references
0.9141456484794616
0 references
0.8507308959960938
0 references
0.843261182308197
0 references
0.8391578793525696
0 references
