Forms of Determinism for Automata (Invited Talk)

Colcombet, Thomas

doi:10.4230/LIPIcs.STACS.2012.1

Document

Forms of Determinism for Automata (Invited Talk)

Author Thomas Colcombet

Part of: Volume: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Symposium on Theoretical Aspects of Computer Science (STACS)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2012-02-24

PDF

File

PDF

LIPIcs.STACS.2012.1.pdf

Filesize: 0.94 MB
23 pages

Document Identifiers

DOI: 10.4230/LIPIcs.STACS.2012.1
URN: urn:nbn:de:0030-drops-33862

Subject Classification

Keywords

Automata
determinism
unambiguity
words
infinite trees

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get BibTex

Thomas Colcombet. Forms of Determinism for Automata (Invited Talk). In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012) https://doi.org/10.4230/LIPIcs.STACS.2012.1

Author Details

Thomas Colcombet

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail