Separating words and trace reconstruction

We prove that for any distinct x,y ∈ {0,1}n, there is a deterministic finite automaton with O(n1/3) states that accepts x but not y. This improves Robson’s 1989 bound of O(n2/5). Using a similar complex analytic technique, we improve the upper bound on worst case trace reconstruction, showing that any unknown string x ∈ {0,1}n can be reconstructed with high probability from exp(O(n1/5)) independently generated traces.

[1]  Akshay Krishnamurthy,et al.  Trace Reconstruction: Generalized and Parameterized , 2019, ESA.

[2]  Alex D. Scott,et al.  Reconstructing sequences , 1997, Discret. Math..

[3]  Rocco A. Servedio,et al.  Polynomial-time trace reconstruction in the smoothed complexity model , 2020, ArXiv.

[4]  Yuval Peres,et al.  Trace reconstruction with exp(O(n1/3)) samples , 2017, STOC.

[5]  Shyam Narayanan,et al.  Population Recovery from the Deletion Channel: Nearly Matching Trace Reconstruction Bounds , 2020, ArXiv.

[6]  Yuval Peres,et al.  Average-Case Reconstruction for the Deletion Channel: Subpolynomially Many Traces Suffice , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[7]  Rocco A. Servedio,et al.  Efficient average-case population recovery in the presence of insertions and deletions , 2019, APPROX-RANDOM.

[8]  Sofya Vorotnikova,et al.  Trace Reconstruction Revisited , 2014, ESA.

[9]  Bruce Spang,et al.  Coded trace reconstruction in a constant number of traces , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[10]  M. N. Vyalyi,et al.  Separating words by occurrences of subwords , 2014 .

[11]  Rina Panigrahy,et al.  Trace reconstruction with constant deletion probability and related results , 2008, SODA '08.

[12]  Ilia Krasikov,et al.  On a Reconstruction Problem for Sequences, , 1997, J. Comb. Theory A.

[13]  Jeffrey Shallit,et al.  Remarks on Separating Words , 2011, DCFS.

[14]  Ryan O'Donnell,et al.  Optimal mean-based algorithms for trace reconstruction , 2017, STOC.

[15]  Tamás Erdélyi,et al.  LITTLEWOOD-TYPE PROBLEMS ON SUBARCS OF THE UNIT CIRCLE , 1997 .

[16]  Sampath Kannan,et al.  Reconstructing strings from random traces , 2004, SODA '04.

[17]  Zachary Chase.  New lower bounds for trace reconstruction , 2021 .

[18]  V. Koubek,et al.  On Discerning Words by Automata , 1986, ICALP.

[19]  Yuval Peres,et al.  Subpolynomial trace reconstruction for random strings and arbitrary deletion probability , 2018, COLT.

[20]  Tamás Erdélyi,et al.  Littlewood‐Type Problems on [0,1] , 1999 .

[21]  John Michael Robson.  Separating Strings with Small Automata , 1989, Inf. Process. Lett..

[22]  Shyam Narayanan,et al.  Circular Trace Reconstruction , 2021, ITCS.

[23]  Russell Lyons,et al.  Lower bounds for trace reconstruction , 2018, ArXiv.

[24]  Miroslav Dudík,et al.  Reconstruction from subsequences , 2003, J. Comb. Theory A.

[25]  Olgica Milenkovic,et al.  Coded Trace Reconstruction , 2019, 2019 IEEE Information Theory Workshop (ITW).

[26]  Rocco A. Servedio,et al.  Beyond Trace Reconstruction: Population Recovery from the Deletion Channel , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

[27]  Cyrus Rashtchian,et al.  Reconstructing Trees from Traces , 2019, COLT.