@inproceedings{10.1007/978-3-642-38771-5_4,
    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.},
    Address = {Berlin, Heidelberg},
    Author = {L{\"o}ding, Christof},
    BookTitle = {Developments in Language Theory},
    Editor = {B{\'e}al, Marie-Pierre and Carton, Olivier},
    File = {10.1007\%2F978-3-642-38771-5\_4 (0) - a - a - c.pdf},
    ISBN = {978-3-642-38771-5},
    Pages = {29--30},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Unambiguous Finite Automata},
    Year = {2013},
    date-added = {2018-06-08 14:53:51 +0000},
    date-modified = {2018-06-08 14:53:51 +0000},
    file-2 = {unambiguous-dlt13 (0) - a - a - c.pdf},
    doi = {10.1007/978-3-642-38771-5_4}
}

@inproceedings{10.1007/978-3-642-38771-5_4, 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.}, Address = {Berlin, Heidelberg}, Author = {L{\"o}ding, Christof}, BookTitle = {Developments in Language Theory}, Editor = {B{\'e}al, Marie-Pierre and Carton, Olivier}, File = {10.1007\%2F978-3-642-38771-5_4 (0) - a - a - c.pdf}, ISBN = {978-3-642-38771-5}, Pages = {29--30}, Publisher = {Springer Berlin Heidelberg}, Title = {Unambiguous Finite Automata}, Year = {2013}, date-added = {2018-06-08 14:53:51 +0000}, date-modified = {2018-06-08 14:53:51 +0000}, file-2 = {unambiguous-dlt13 (0) - a - a - c.pdf}, doi = {10.1007/978-3-642-38771-5_4} }