Abstract
A natural class in-between deterministic and non-deterministic automata is the class of unambiguous ones — an automaton is unambiguous if it has at most one accepting run on every tree. It seems that an unambiguous automaton represents the structure of the recognised language in a more rigid way than a general non-deterministic automaton. However, as shown in [NW96], there are ambiguous regular tree languages — languages that are not recognised by any unambiguous automaton.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Skrzypczak, M. (2016). Collapse for Unambiguous Automata. In: Descriptive Set Theoretic Methods in Automata Theory. Lecture Notes in Computer Science(), vol 9802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-52947-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-52947-8_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-52946-1
Online ISBN: 978-3-662-52947-8
eBook Packages: Computer ScienceComputer Science (R0)