vix.ing · top · new · best · stats · spec

Jeffrey Shallit

  1. Polynomial versus Exponential Growth in Repetition-Free Binary Words
    2003/04/07 by Juhani Karhumäki, Juhani Karhumaki, Karhumaki, Juhani +2 · 4 citations
    Computer Science · Mathematics · #Algorithms and Data Compression #Logic, programming, and type systems #cs.DM #math.CO #msc:68R15 #semigroups and automata theory
  2. Remarks on separating words
    2011/03/23 by Erik D. Demaine, Demaine, Erik D., Sarah Eisenstat +5 · 2 citations
    Computer Science · Biochemistry, Genetics and Molecular Biology · #semigroups and automata theory #DNA and Biological Computing #Coding theory and cryptography
  3. Avoiding large squares in infinite binary words
    2003/06/04 by Narad Rampersad, Jeffrey Shallit, Rampersad, Narad +3 · 1 citation
    Computer Science · Mathematics · #68R15 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO #msc:68R15
  4. Words avoiding reversed subwords
    2003/11/07 by Narad Rampersad, Jeffrey Shallit, Rampersad, Narad +1 · 1 citation
    Mathematics · #68R15 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:68R15
  5. 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
  6. Fife's Theorem Revisited
    2011/02/18 by Jeffrey Shallit, Shallit, Jeffrey · 1 citation
    Computer Science · Biochemistry, Genetics and Molecular Biology · #semigroups and automata theory #DNA and Biological Computing #Algorithms and Data Compression
  7. Sums of Palindromes: an Approach via Automata
    2017/06/30 by Aayush Rajasekaran, Jeffrey Shallit, Rajasekaran, Aayush +3 · 1 citation
    Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Number Theory (math.NT) #semigroups and automata theory
  8. Additive Number Theory via Approximation by Regular Languages
    2018/04/21 by Jason P. Bell, Bell, Jason, Thomas F. Lidbetter +3 · 1 citation
    Computer Science · Mathematics · #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Mathematical Dynamics and Fractals #Number Theory (math.NT) #semigroups and automata theory
  9. Rarefied Thue-Morse Sums Via Automata Theory and Logic
    2023/02/18 by Jeffrey Shallit, Shallit, Jeffrey · 2 citations
    Computer Science · Mathematics · #Advanced Mathematical Identities #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Number Theory (math.NT) #semigroups and automata theory
  10. Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance
    2014/06/03 by Chen Fei Du, Du, Chen Fei, Hamoon Mousavi +5 · 1 citation
    Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #Combinatorics (math.CO) #DNA and Biological Computing #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory
  11. How to prove that a sequence is not automatic
    2021/04/27 by Jean‐Paul Allouche, Allouche, J. -P., Jeffrey Shallit +3 · 1 citation
    Computer Science · #11B85 #68R15 #Algorithms and Data Compression #Computability, Logic, AI Algorithms #FOS: Mathematics #Number Theory (math.NT) #semigroups and automata theory
  12. Automatic Sequences in Negative Bases and Proofs of Some Conjectures of Shevelev
    2022/08/11 by Jeffrey Shallit, Sonja Linghui Shan, Shallit, Jeffrey +3 · 2 citations
    Computer Science · Mathematics · #semigroups and automata theory #Computability, Logic, AI Algorithms #Benford’s Law and Fraud Detection
  13. The Repetition Threshold for Rote Sequences
    2024/06/25 by Nicolas Ollinger, Ollinger, Nicolas, Jeffrey Shallit +1 · 2 citations
    Computer Science · #Cellular Automata and Applications #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) #semigroups and automata theory
  14. Proving Properties of φ-Representations with the Walnut Theorem-Prover
    2023/05/04 by Jeffrey Shallit · 1 citation
    Computer Science · Mathematics · #math.NT #cs.DM #cs.FL
  15. 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
  16. More Infinite Products: Thue-Morse and the Gamma function
    2017/09/11 by Jean‐Paul Allouche, Allouche, Jean-Paul, Samin Riasat +3 · 1 citation
    Computer Science · Mathematics · #11A63 #11B83 #11B85 #68R15 #Advanced Combinatorial Mathematics #Algorithms and Data Compression #FOS: Mathematics #Number Theory (math.NT) #semigroups and automata theory
  17. 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
  18. Some Remarks on Palindromic Periodicities
    2024/07/15 by Gabriele Fici, Fici, Gabriele, Jeffrey Shallit +3 · 1 citation
    Mathematics · #Analytic and geometric function theory #Graph theory and applications
  19. A variant of Hofstadter's sequence and finite automata
    2011/03/06 by Jean‐Paul Allouche, Allouche, J. -P., Jeffrey Shallit +1 · 1 citation
    Computer Science · #Advanced Algebra and Logic #Algorithms and Data Compression #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Number Theory (math.NT) #semigroups and automata theory
  20. Combinatorics on words and generating Dirichlet series of automatic sequences
    2025/03/21 by Jean‐Paul Allouche, Jean-Paul Allouche, Jeffrey Shallit +1 · 1 citation
    Computer Science · Mathematics · #semigroups and automata theory #Mathematical Dynamics and Fractals #Advanced Combinatorial Mathematics
  21. Runs in Paperfolding Sequences
    2024/12/23 by Jeffrey Shallit, Shallit, Jeffrey · 1 citation
    Computer Science · #Cellular Automata and Applications #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL)
  22. 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