A family of NFAs which need 2\(^{n}-\alpha\) deterministic states (Q1400001): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Mike S. Paterson / rank | |||
Property / author | |||
Property / author: Mike S. Paterson / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4779161 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3915990 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5554980 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5541339 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3680279 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(02)00891-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2062010498 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:22, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A family of NFAs which need 2\(^{n}-\alpha\) deterministic states |
scientific article |
Statements
A family of NFAs which need 2\(^{n}-\alpha\) deterministic states (English)
0 references
30 July 2003
0 references
Deterministic finite automaton
0 references
nondeterministic finite automaton
0 references
size of automaton
0 references
magic number
0 references