Narad Rampersad
- Avoiding large squares in infinite binary words
2003/06/04 by Narad Rampersad, Rampersad, Narad, Jeffrey Shallit +4 · 1 citation
Computer Science · Mathematics · #68R15 #Algorithms and Data Compression #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO #msc:68R15 #semigroups and automata theory
- Words avoiding reversed subwords
2003/11/07 by Narad Rampersad, Rampersad, Narad, Jeffrey Shallit +1 · 1 citation
Mathematics · #68R15 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:68R15
- Recurrent words with constant Abelian complexity
2009/11/26 by James D. Currie, Narad Rampersad, Currie, James +1 · 1 citation
Computer Science · Biochemistry, Genetics and Molecular Biology · #semigroups and automata theory #Cellular Automata and Applications #DNA and Biological Computing
- Shuffling and Unshuffling
2011/06/28 by Dane Henshall, Narad Rampersad, Henshall, D. +3 · 1 citation
Computer Science · #Advanced Algebra and Logic #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic, programming, and type systems #semigroups and automata theory
- Fixed points avoiding Abelian k-powers
2011/06/09 by James D. Currie, Narad Rampersad, Currie, James D. +1 · 2 citations
Computer Science · #68R15 #Advanced Algebra and Logic #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory
- Properties of a Ternary Infinite Word
2022/06/03 by James D. Currie, Pascal Ochem, Currie, James +5 · 3 citations
Computer Science · #Advanced Algebra and Logic #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory
- Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci\n Infinite Words
2019/05/03 by Marieh Jahannia, Jahannia, Marieh, Morteza Mohammad-Noori +5 · 1 citation
Computer Science · #68R15 #Authorship Attribution and Profiling #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory
- Closed Ziv-Lempel factorization of the m-bonacci words
2021/06/06 by Marieh Jahannia, Morteza Mohammad-Noori, Jahannia, Marieh +5 · 1 citation
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Rings, Modules, and Algebras #semigroups and automata theory
- Extremal overlap-free and extremal β-free binary words
2020/06/17 by L. A. S. Mόl, Mol, Lucas, Narad Rampersad +3 · 1 citation
Computer Science · #68R15 #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Machine Learning and Algorithms #semigroups and automata theory
- Complement Avoidance in Binary Words
2022/09/20 by James D. Currie, Currie, James, Pascal Ochem +7 · 1 citation
Computer Science · #semigroups and automata theory #Computability, Logic, AI Algorithms #Advanced Algebra and Logic
- The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
2009/07/01 by Narad Rampersad, Rampersad, N., Jeffrey Shallit +3 · 1 citation
Computer Science · #Algorithms and Data Compression #Coding theory and cryptography #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory