Translating regular expressions into small \(\epsilon \)-free nondeterministic finite automata (Q5047159)
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 7614456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Translating regular expressions into small \(\epsilon \)-free nondeterministic finite automata |
scientific article; zbMATH DE number 7614456 |
Statements
Translating regular expressions into small ε-free nondeterministic finite automata (English)
0 references
9 November 2022
0 references
0.9759213328361512
0 references
0.9120060205459596
0 references
0.9056476354599
0 references
