Forms of Determinism for Automata∗


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. 1998 ACM Subject Classification F.1.1 Models of Computation, F.1.2 Modes of Computation, F.4.3 Formal Languages

Extracted Key Phrases

Cite this paper

@inproceedings{Colcombet2012FormsOD, title={Forms of Determinism for Automata∗}, author={Thomas Colcombet}, year={2012} }