Abstract
In general, a nondeterministic automaton or machine (for example a finite automaton, pushdown automaton or Turing machine) is called unambiguous if each input is accepted by at most one run or computation. Each deterministic automaton is obviously unambiguous. However, in many settings, unambiguous automata are more expressive or admit more succinct automata than deterministic models, while preserving some good algorithmic properties. The aim of this talk is to survey some classical and some more recent results on unambiguous finite automata over different kind of input structures, namely finite words, infinite words, finite trees, and infinite trees.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
