Skip to Main content Skip to Navigation
Conference papers

Forms of Determinism for Automata

Abstract : We survey in this paper some variants of the notion of determinism, refining the spectrum between non-determinism and determinism. We present unambiguous automata, strongly unambiguous automata, prophetic automata, guidable automata, and history-deterministic automata. We instantiate these various notions for finite words, infinite words, finite trees, infinite trees, data languages, and cost functions. The main results are underlined and some open problems proposed.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00678155
Contributor : Christoph Dürr <>
Submitted on : Friday, February 3, 2012 - 10:00:00 AM
Last modification on : Saturday, March 28, 2020 - 2:17:50 AM
Document(s) archivé(s) le : Thursday, November 22, 2012 - 10:50:58 AM

File

2.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00678155, version 1

Collections

Citation

Thomas Colcombet. Forms of Determinism for Automata. STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.1-23. ⟨hal-00678155⟩

Share

Metrics

Record views

183

Files downloads

489