An optimal construction of finite automata from regular expressions (Q3165960)
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 6096490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal construction of finite automata from regular expressions |
scientific article; zbMATH DE number 6096490 |
Statements
19 October 2012
0 references
finite automata
0 references
regular expressions
0 references
descriptional complexity
0 references
An Optimal Construction of Finite Automata from Regular Expressions (English)
0 references
0.858464777469635
0 references
0.8325194716453552
0 references
0.8130361437797546
0 references
