DagRep.11.10.57.pdf
- Filesize: 2.94 MB
- 15 pages
Document
Unambiguity in Automata Theory (Dagstuhl Seminar 21452)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 11, Issue 10
Volume: Dagstuhl Reports, Volume 11
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2022-04-11
Cite As Get 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)
https://doi.org/10.4230/DagRep.11.10.57
Abstract
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
Keywords
- Unambiguity in Automata Theory
- Dagstuhl Seminar
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads