From regular expressions to deterministic finite automata: \(2^{\frac{n}{2}+\sqrt{n}(\log n)^{\varTheta (1)}}\) states are necessary and sufficient (Q6861674)
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 8156718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From regular expressions to deterministic finite automata: \(2^{\frac{n}{2}+\sqrt{n}(\log n)^{\varTheta (1)}}\) states are necessary and sufficient |
scientific article; zbMATH DE number 8156718 |
Statements
From regular expressions to deterministic finite automata: \(2^{\frac{n}{2}+\sqrt{n}(\log n)^{\varTheta (1)}}\) states are necessary and sufficient (English)
0 references
10 February 2026
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
