作者: Andrey N. Plyushchenko , Arseny M. Shur
DOI: 10.1007/978-3-642-22321-1_31
关键词: Beal's conjecture 、 Combinatorics 、 Semigroup 、 Mathematics 、 Discrete mathematics 、 Regular language 、 Collatz conjecture 、 Congruence class 、 Word problem (mathematics) 、 X.3 、 Conjecture
摘要: In this paper we examine Brzozowski's conjecture for the two-generated free Burnside semigroup satisfying x2 = x3. The elements of are classes equivalent words, and claims that all regular languages. case identity x3 is only one, which neither proved nor disproved. We prove containing an overlap-free or "almost" word. addition, show but finitely many these "big" languages in terms growth rate.