| Issue |
RAIRO-Theor. Inf. Appl.
Volume 41, Number 3, July-September 2007
|
|
|---|---|---|
| Page(s) | 261 - 265 | |
| DOI | https://doi.org/10.1051/ita:2007017 | |
| Published online | 25 September 2007 | |
An upper bound for transforming self-verifying automata into deterministic ones
1
RWTH Aachen, Lehrstuhl für Informatik
IX, Ahornstr. 55, 52074 Aachen, Germany; assent@informatik.rwth-aachen.de
2
ETH Zürich, Department
Informatik, Informationstechnologie und Ausbildung, ETH Zentrum,
8092 Zürich, Switzerland; sseibert@inf.ethz.ch
Received:
20
May
2005
Accepted:
17
August
2005
This paper describes a modification of the power set
construction 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 
to 
Mathematics Subject Classification: 68Q10 / 68Q19
Key words: Self-verifying nondeterministic automata / descriptional complexity / power set construction
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.