On a generalization of abelian equivalence and complexity of infinite words (Q388738): Difference between revisions

@@ Property / author @@
-Juhani Karhumäki
@@ Property / author: Juhani Karhumäki / rank @@
-Normal rank
@@ Property / author @@
+Juhani Karhumäki
@@ Property / author: Juhani Karhumäki / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+A05
@@ Property / Mathematics Subject Classification ID: 05A05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R15
@@ Property / Mathematics Subject Classification ID: 68R15 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6243014
@@ Property / zbMATH DE Number: 6243014 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+abelian equivalence
@@ Property / zbMATH Keywords: abelian equivalence / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complexity of words
@@ Property / zbMATH Keywords: complexity of words / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Sturmian words
@@ Property / zbMATH Keywords: Sturmian words / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Szemerédi's theorem
@@ Property / zbMATH Keywords: Szemerédi's theorem / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2012233760
@@ Property / OpenAlex ID: W2012233760 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5104
@@ Property / arXiv ID: 1301.5104 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite permutations of lowest maximal pattern complexity
+Normal rank
@@ Property / cites work @@
+Some characterizations of Sturmian words in terms of the lexicographic order
+Normal rank
@@ Property / cites work @@
+AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
+Normal rank
@@ Property / cites work @@
+Sequences with minimal block growth
@@ Property / cites work: Sequences with minimal block growth / rank @@
+Normal rank
@@ Property / cites work @@
+Recurrent words with constant abelian complexity
@@ Property / cites work: Recurrent words with constant abelian complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly non-repetitive sequences and progression-free sets
+Normal rank
@@ Property / cites work @@
+Episturmian words and some constructions of de Luca and Rauzy
+Normal rank
@@ Property / cites work @@
+Elementary homomorphisms and a solution of the DOL sequence equivalence problem
+Normal rank
@@ Property / cites work @@
+Generalized balances in Sturmian words
@@ Property / cites work: Generalized balances in Sturmian words / rank @@
+Normal rank
@@ Property / cites work @@
+On periodicity and low complexity of infinite permutations
+Normal rank
@@ Property / cites work @@
+On factor graphs of DOL words
@@ Property / cites work: On factor graphs of DOL words / rank @@
+Normal rank
@@ Property / cites work @@
+Existence of an infinite ternary 64-abelian square-free word
+Normal rank
@@ Property / cites work @@
+Problems in between words and abelian words: \(k\)-abelian avoidability
+Normal rank
@@ Property / cites work @@
+Sequence entropy and the maximal pattern complexity of infinite words
+Normal rank
@@ Property / cites work @@
+Generalized Parikh mappings and homomorphisms
@@ Property / cites work: Generalized Parikh mappings and homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+On cube-free \(\omega\)-words generated by binary morphisms
+Normal rank
@@ Property / cites work @@
+Abelian squares are avoidable on 4 letters
@@ Property / cites work: Abelian squares are avoidable on 4 letters / rank @@
+Normal rank
@@ Property / cites work @@
+Q4341774
@@ Property / cites work: Q4341774 / rank @@
+Normal rank
@@ Property / cites work @@
+-Abelian cubes are avoidable on binary alphabets
@@ Property / cites work: 5-Abelian cubes are avoidable on binary alphabets / rank @@
+Normal rank
@@ Property / cites work @@
+-Abelian Cubes Are Avoidable on Binary Alphabets
@@ Property / cites work: 3-Abelian Cubes Are Avoidable on Binary Alphabets / rank @@
+Normal rank
@@ Property / cites work @@
+Repetitions in the Fibonacci infinite word
@@ Property / cites work: Repetitions in the Fibonacci infinite word / rank @@
+Normal rank
@@ Property / cites work @@
+A variant of a recursively unsolvable problem
@@ Property / cites work: A variant of a recursively unsolvable problem / rank @@
+Normal rank
@@ Property / cites work @@
+Abelian returns in Sturmian words
@@ Property / cites work: Abelian returns in Sturmian words / rank @@
+Normal rank
@@ Property / cites work @@
+Balance and abelian complexity of the Tribonacci word
+Normal rank
@@ Property / cites work @@
+Abelian complexity of minimal subshifts
@@ Property / cites work: Abelian complexity of minimal subshifts / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of Sturmian sequences: Combinatorial structure and transcendence
+Normal rank
@@ Property / cites work @@
+Q3589628
@@ Property / cites work: Q3589628 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:388738