Forms of Determinism for Automata

Thomas Colcombet (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

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.

Mots clés: Automata; determinism; unambiguity; words; infinite trees

Domaines: Complexité [cs.CC]; Algorithme et structure de données [cs.DS]

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⟩