From regular expressions to finite automata<sup>∗</sup> (Q4944659)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: From regular expressions to finite automata∗ |
scientific article; zbMATH DE number 1420184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From regular expressions to finite automata<sup>∗</sup> |
scientific article; zbMATH DE number 1420184 |
Statements
From regular expressions to finite automata<sup>∗</sup> (English)
0 references
21 March 2000
0 references
Brzozowski algorithm
0 references
Glushkov automaton
0 references
0 references
0.8662382960319519
0 references
0.8584500551223755
0 references
0.8505052328109741
0 references
