Brzozowski's conjecture: Start from any word w, and replace any occurrence uwn x by uwn+1 x or vice versa. Is the resulting language regular? This is easily seen for n = 1, and it has been proven for n ≥ 3. The case n = 2 is still open.

-- JeffreyShallit - 13 Jul 2011

Topic revision: r1 - 2011-07-13 - JeffreyShallit
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2024 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback