An upper bound for transforming self-verifying automata into deterministic ones (Q5425747): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3862379 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata / 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 | |||
Latest revision as of 12:07, 27 June 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
