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

Metadata only

Author

Date

2007

Type

Journal Article

ETH Bibliography

yes

Altmetrics

Publication status

published

External links

Journal / series

RAIRO - Theoretical Informatics and Applications

Volume

41(3)

Pages / Article No.

261 - 265

Publisher

EDP Sciences

Subject

Self-verifying nondeterministic automata; Descriptional complexity; Power set construction

Organisational unit

03666 - Hromkovic, Juraj / Hromkovic, Juraj

Notes

Received 20 May 2005, Accepted 17 August 2005, Published online 25 September 2007.

More

ETH Bibliography

yes

Altmetrics

Research Collection