Obtaining shorter regular expressions from finite-state automata (Q868946)
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: Obtaining shorter regular expressions from finite-state automata |
scientific article; zbMATH DE number 5129786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Obtaining shorter regular expressions from finite-state automata |
scientific article; zbMATH DE number 5129786 |
Statements
Obtaining shorter regular expressions from finite-state automata (English)
0 references
26 February 2007
0 references
regular languages
0 references
finite-state automata
0 references
state elimination
0 references
bridge states
0 references
vertical chopping
0 references
horizontal chopping
0 references
0.97713655
0 references
0.94868124
0 references
0 references
0.92249316
0 references
0.9001076
0 references
0.8948795
0 references
0.8896738
0 references
0.8891357
0 references
