Unambiguity in Automata Theory (Dagstuhl Seminar 21452)

Authors Thomas Colcombet, Karin Quaas, Michał Skrzypczak and all authors of the abstracts in this report

Thumbnail PDF


  • Filesize: 2.94 MB
  • 15 pages

Document Identifiers

Author Details

Thomas Colcombet
  • Université Paris Diderot
Karin Quaas
  • Universität Leipzig
Michał Skrzypczak
  • University of Warsaw
and all authors of the abstracts in this report

Cite AsGet BibTex

Thomas Colcombet, Karin Quaas, and Michał Skrzypczak. Unambiguity in Automata Theory (Dagstuhl Seminar 21452). In Dagstuhl Reports, Volume 11, Issue 10, pp. 57-71, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


This report documents the program and the outcomes of Dagstuhl Seminar 21452 "Unambiguity in Automata Theory". The aim of the seminar was to improve the understanding of the notion of unambiguity in automata theory, especially with respect to questions related to the expressive power, succinctness, and the tractability of unambiguous devices. The main motivation behind these studies is the hope that unambiguous machines can provide a golden balance between efficiency - sometimes not worse than for deterministic devices - and expressibility / succinctness, which often is similar to the general nondeterministic machines. These trade-offs become especially important in the models where the expressiveness or the decidability status of unambiguous machines is different from that of nondeterministic ones, as it is the case, e.g., for register automata.

Subject Classification

ACM Subject Classification
  • Theory of computation → Regular languages
  • Theory of computation → Automata over infinite objects
  • Theory of computation → Algebraic language theory
  • Theory of computation → Tree languages
  • Unambiguity in Automata Theory
  • Dagstuhl Seminar


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads