Proof of Correctness of a Direct Construction of DFA from Regular Expression (Q4384033)
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: Proof of Correctness of a Direct Construction of DFA from Regular Expression |
scientific article; zbMATH DE number 1143876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof of Correctness of a Direct Construction of DFA from Regular Expression |
scientific article; zbMATH DE number 1143876 |
Statements
Proof of Correctness of a Direct Construction of DFA from Regular Expression (English)
0 references
20 April 1998
0 references
deterministic finite automaton
0 references
dot annotated regular expression
0 references
0.7441309094429016
0 references
0.7346934080123901
0 references
0.7314847111701965
0 references
