30 citations · 79 across the 16 of their papers we have counts for
1 paper · 1 filter
Aryeh Kontorovich, Ari Trachtenberg
We revisit the problem of deciding whether a given string is uniquely decodable from its bigram counts by means of a finite automaton. An efficient algorithm for constructing a pol…