Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Currently displaying 1 – 1 of 1

Order by Relevance | Title | Year of publication

An upper bound for transforming self-verifying automata into deterministic ones

Ira Assent; Sebastian Seibert — 2007

RAIRO - Theoretical Informatics and Applications

This paper describes a modification of the for the transformation of self-verifying nondeterministic finite automata to deterministic ones. Using a set counting argument, the upper bound for this transformation can be lowered from $2^{n}$ to $O (\frac{2^{n}}{\sqrt{n}}) .$

Page 1

Download Results (CSV)