Reducing NFAs by invariant equivalences. (Q1426461)
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 2056806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing NFAs by invariant equivalences. |
scientific article; zbMATH DE number 2056806 |
Statements
Reducing NFAs by invariant equivalences. (English)
0 references
14 March 2004
0 references
Non-deterministic finite automata
0 references
Regular expressions
0 references
Automata minimization
0 references
Invariant equivalences
0 references
Derivatives of regular expressions
0 references
0 references
0 references
0.8558490872383118
0 references
0.8434721827507019
0 references
0.8389856815338135
0 references
