login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Maximum size of a class of binary words of length n having the same prefix normal form.
0

%I #38 Jul 02 2021 16:52:51

%S 1,2,3,4,5,6,8,10,12,18,24,30,40,60,80,111,165,246,369,596,894,1406,

%T 2109,3462,5193,8528,12792,21390,32085,53206,79809,135064,202596

%N Maximum size of a class of binary words of length n having the same prefix normal form.

%H Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, and Joe Sawada, <a href="https://arxiv.org/abs/2003.03222">Generating a Gray code for prefix normal words in amortized polylogarithmic time per word</a>, arXiv:2003.03222 [cs.DS], 2020.

%H Peter Burcsi, G. Fici, Z. Lipták, F. Ruskey, and J. Sawada, <a href="http://www.cis.uoguelph.ca/~sawada/papers/pnf.pdf">On prefix normal words and prefix normal forms</a>, Preprint, 2016.

%H Ferdinando Cicalese, Zsuzsanna Lipták, and Massimiliano Rossi, <a href="https://arxiv.org/abs/1712.05876">Bubble-Flip—A new generation algorithm for prefix normal words</a>, arXiv:1712.05876 [cs.DS], 2017-2018; Theoretical Computer Science, Volume 743, 26 September 2018, Pages 38-52.

%H Ferdinando Cicalese, Zsuzsanna Lipták, and Massimiliano Rossi, <a href="https://arxiv.org/abs/1811.06273">On Infinite Prefix Normal Words</a>, arXiv:1811.06273 [math.CO], 2018.

%H G. Fici and Zs. Lipták, <a href="http://www.i3s.unice.fr/~mh/RR/2011/RR-11-03-G.FICI.pdf">On Prefix Normal Words</a> (see Table 5).

%H G. Fici and Zs. Lipták, <a href="http://dx.doi.org/10.1007/978-3-642-22321-1_20">On Prefix Normal Words</a>, Developments in Language Theory 2011, Lecture Notes in Computer Science 6795, 228-238.

%H Pamela Fleischmann, <a href="https://macau.uni-kiel.de/servlets/MCRFileNodeServlet/macau_derivate_00002273/diss.pdf">On Special k-Spectra, k-Locality, and Collapsing Prefix Normal Words</a>, Ph.D. Dissertation, Kiel University (Germany, 2021).

%H Pamela Fleischmann, Mitja Kulczynski, and Dirk Nowotka, <a href="https://arxiv.org/abs/1905.11847">On Collapsing Prefix Normal Words</a>, arXiv:1905.11847 [cs.FL], 2019.

%H Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka, and Danny Bøgsted Poulsen, <a href="https://doi.org/10.1007/978-3-030-40608-0_29">On Collapsing Prefix Normal Words</a>, Language and Automata Theory and Applications (LATA 2020) LNCS Vol. 12038, Springer, Cham, 412-424.

%H Zsuzsanna Lipták, <a href="http://profs.scienze.univr.it/~liptak/files/OpenProblemsPNW.pdf">Open problems on prefix normal words</a>, also in <a href="http://drops.dagstuhl.de/opus/volltexte/2019/10178/">Dagstuhl Reports</a> (2018) Vol. 8, Issue 7, 59-61.

%Y Cf. A194850, A238109.

%K nonn,more

%O 1,2

%A _N. J. A. Sloane_, Mar 02 2014

%E a(17)-a(33) from _Lars Blomberg_, Jun 16 2017