An upper bound for transforming self-verifying automata into deterministic ones (Q5425747): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 20:55, 5 March 2024
scientific article; zbMATH DE number 5211859
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for transforming self-verifying automata into deterministic ones |
scientific article; zbMATH DE number 5211859 |
Statements
An upper bound for transforming self-verifying automata into deterministic ones (English)
0 references
14 November 2007
0 references
self-verifying nondeterministic automata
0 references
descriptional complexity
0 references
power set construction
0 references
