1 citations · 1 across the 1 of their papers we have counts for
1 paper
Alexander Rabinovich, Doron Tiferet
An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k > 0) if for every input it has at most k accepting compu…