Jeffrey O. Shallit

ORCID

Publication Activity (10 Years)

Years Active: 1976-2024
Publications (10 Years): 174

Top Venues

CoRR

Theor. Comput. Sci.

WORDS

Int. J. Found. Comput. Sci.

Publications

Aaron Barnoff, Curtis Bright, Jeffrey O. Shallit
Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals. CoRR (2024)
Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit
Decidability for Sturmian words. Log. Methods Comput. Sci. 20 (3) (2024)
Ali Keramatipour, Jeffrey O. Shallit
Record-setters in the Stern sequence. Discret. Math. 347 (4) (2024)
Nicolas Ollinger, Jeffrey O. Shallit
The Repetition Threshold for Rote Sequences. CoRR (2024)
Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson
Some Remarks on Palindromic Periodicities. CoRR (2024)
Jean-Paul Allouche, John M. Campbell, Jeffrey O. Shallit, Manon Stipulanti
The reflection complexity of sequences over finite alphabets. CoRR (2024)
Luke Schaeffer, Jeffrey O. Shallit, Stefan Zorcic
Beatty Sequences for a Quadratic Irrational: Decidability and Applications. CoRR (2024)
Jeffrey O. Shallit
Proving properties of some greedily-defined integer recurrences via automata theory. Theor. Comput. Sci. 988 (2024)
Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit
Repetition Threshold for Binary Automatic Sequences. CoRR (2024)
Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic
Power-free complementary binary morphisms. J. Comb. Theory, Ser. A 207 (2024)
Daniel Krenn, Jeffrey O. Shallit
Strongly k-recursive sequences. CoRR (2024)
Jason P. Bell, Chris Schulz, Jeffrey O. Shallit
Consecutive Power Occurrences in Sturmian Words. CoRR (2024)
Jean-Paul Allouche, Jeffrey O. Shallit, Manon Stipulanti
Combinatorics on words and generating Dirichlet series of automatic sequences. CoRR (2024)
Jeffrey O. Shallit
Proof of Irvine's Conjecture via Mechanized Guessing. CoRR (2023)
Jeffrey O. Shallit
Proving properties of some greedily-defined integer recurrences via automata theory. CoRR (2023)
Jeffrey O. Shallit, Sonja Linghui Shan
A General Approach to Proving Properties of Fibonacci Representations via Automata Theory. AFL (2023)
Jeffrey O. Shallit, Anatoly Zavyalov
Transduction of Automatic Sequences and Applications. CIAA (2023)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. 57 (2023)
Jeffrey O. Shallit
Proof of a conjecture of Krawchuk and Rampersad. CoRR (2023)
Jeffrey O. Shallit
Proving Results About OEIS Sequences with Walnut. CICM (2023)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Dyck Words, Pattern Avoidance, and Automatic Sequences. WORDS (2023)
Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic
-free binary morphisms. CoRR (2023)
Jeffrey O. Shallit
Prefixes of the Fibonacci word. CoRR (2023)
Jeffrey O. Shallit, Sonja Linghui Shan, Kai-Hsiang Yang
Automatic sequences in negative bases and proofs of some conjectures of shevelev. RAIRO Theor. Informatics Appl. 57 (2023)
Daniel Gabric, Jeffrey O. Shallit
Smallest and Largest Block Palindrome Factorizations. CoRR (2023)
Jeffrey O. Shallit, Xinhao Xu
Repetition factorization of automatic sequences. CoRR (2023)
Narad Rampersad, Jeffrey O. Shallit
Rudin-Shapiro Sums Via Automata Theory and Logic. CoRR (2023)
Robert Cummings, Jeffrey O. Shallit, Paul Staadecker
Mesosome avoidance. Inf. Process. Lett. 179 (2023)
Jeffrey O. Shallit
Note on a Fibonacci parity sequence. Cryptogr. Commun. 15 (2) (2023)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Dyck Words, Pattern Avoidance, and Automatic Sequences. CoRR (2023)
Jeffrey O. Shallit
Rarefied Thue-Morse Sums Via Automata Theory and Logic. CoRR (2023)
Jeffrey O. Shallit
A Dombi Counterexample with Positive Lower Density. CoRR (2023)
Narad Rampersad, Jeffrey O. Shallit
Rudin-Shapiro Sums via Automata Theory and Logic. WORDS (2023)
Benoit Cloitre, Jeffrey O. Shallit
Some Fibonacci-Related Sequences. CoRR (2023)
Daniel Gabric, Jeffrey O. Shallit
Smallest and Largest Block Palindrome Factorizations. WORDS (2023)
Jeffrey O. Shallit
Sumsets of Wythoff sequences, Fibonacci representation, and beyond. Period. Math. Hung. 84 (1) (2022)
Jason P. Bell, Jeffrey O. Shallit
Lie complexity of words. Theor. Comput. Sci. 927 (2022)
Jeffrey O. Shallit
Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk). CPM (2022)
Daniel Gabric, Stepan Holub, Jeffrey O. Shallit
Maximal state complexity and generalized de Bruijn words. Inf. Comput. 284 (2022)
Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit
Decidability for Sturmian Words. CSL (2022)
James Haoyu Bai, Joseph Meleshko, Samin Riasat, Jeffrey O. Shallit
Quotients of Palindromic and Antipalindromic Numbers. CoRR (2022)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Complement Avoidance in Binary Words. CoRR (2022)
Joseph Meleshko, Pascal Ochem, Jeffrey O. Shallit, Sonja Linghui Shan
Pseudoperiodic Words and a Question of Shevelev. CoRR (2022)
Luke Schaeffer, Jeffrey O. Shallit
The First-Order Theory of Binary Overlap-Free Words is Decidable. CoRR (2022)
Phakhinkon Phunphayap, Prapanpong Pongsriiam, Jeffrey O. Shallit
Sumsets associated with Beatty sequences. Discret. Math. 345 (5) (2022)
Jeffrey O. Shallit
Intertwining of Complementary Thue-Morse Factors. CoRR (2022)
Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Antisquares and Critical Exponents. CoRR (2022)
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Properties of a Ternary Infinite Word. CoRR (2022)
Narad Rampersad, Jeffrey O. Shallit
Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton. Electron. J. Comb. 29 (3) (2022)
Jeffrey O. Shallit
Note on a Fibonacci Parity Sequence. CoRR (2022)
Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman
Computational aspects of sturdy and flimsy numbers. Theor. Comput. Sci. 927 (2022)
Jason P. Bell, Jeffrey O. Shallit
Automatic sequences of rank two. RAIRO Theor. Informatics Appl. 56 (2022)
Daniel Krenn, Jeffrey O. Shallit
-regular sequences. Theor. Comput. Sci. 907 (2022)
Jeffrey O. Shallit
Some Tribonacci Conjectures. CoRR (2022)
Gabriele Fici, Jeffrey O. Shallit
Properties of a class of Toeplitz words. Theor. Comput. Sci. 922 (2022)
Jason P. Bell, Jeffrey O. Shallit
Counterexamples to a Conjecture of Dombi in Additive Number Theory. CoRR (2022)
Jeffrey O. Shallit, Sonja Linghui Shan, Kai-Hsiang Yang
Automatic Sequences in Negative Bases and Proofs of Some Conjectures of Shevelev. CoRR (2022)
Jeffrey O. Shallit
Hilbert's spacefilling curve described by automatic, regular, and synchronized sequences. CoRR (2021)
Daniel Gabric, Jeffrey O. Shallit
The simplest binary word with only three squares. RAIRO Theor. Informatics Appl. 55 (2021)
Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman
Computational Fun with Sturdy and Flimsy Numbers. FUN (2021)
Daniel Gabric, Jeffrey O. Shallit
Borders, palindrome prefixes, and square prefixes. Inf. Process. Lett. 165 (2021)
Jeffrey O. Shallit
Frobenius Numbers and Automatic Sequences. CoRR (2021)
Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit
An Inequality for the Number of Periods in a Word. Int. J. Found. Comput. Sci. 32 (5) (2021)
Jeffrey O. Shallit
Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs. CIAA (2021)
Daniel Gabric, Jeffrey O. Shallit, Xiaofeng Zhong
Avoidance of split overlaps. Discret. Math. 344 (2) (2021)
Robert Cummings, Jeffrey O. Shallit, Paul Staadecker
Mesosome Avoidance. CoRR (2021)
Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit
Decidability for Sturmian words. CoRR (2021)
Lukas Fleischer, Jeffrey O. Shallit
Automata, Palindromes, and Reversed Subwords. J. Autom. Lang. Comb. 26 (3-4) (2021)
Aseem R. Baranwal, Luke Schaeffer, Jeffrey O. Shallit
Ostrowski-automatic sequences: Theory and applications. Theor. Comput. Sci. 858 (2021)
Jason P. Bell, Jeffrey O. Shallit
Automatic Sequences of Rank Two. CoRR (2021)
Narad Rampersad, Jeffrey O. Shallit
Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton. CoRR (2021)
James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers. CoRR (2021)
Jeffrey O. Shallit
Robbins and Ardila meet Berstel. Inf. Process. Lett. 167 (2021)
Jeffrey O. Shallit
Synchronized Sequences. WORDS (2021)
Jason P. Bell, Jeffrey O. Shallit
Lie complexity of words. CoRR (2021)
Gabriele Fici, Jeffrey O. Shallit
Properties of a Class of Toeplitz Words. CoRR (2021)
Lukas Fleischer, Jeffrey O. Shallit
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages. Int. J. Found. Comput. Sci. 32 (6) (2021)
Jeffrey O. Shallit
Additive Number Theory via Automata and Logic. CoRR (2021)
Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit
An inequality for the number of periods in a word. CoRR (2020)
Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman
Computational Aspects of Sturdy and Flimsy Numbers. CoRR (2020)
F. Michel Dekking, Jeffrey O. Shallit, Neil J. A. Sloane
Queens in Exile: Non-attacking Queens on Infinite Chess Boards. Electron. J. Comb. 27 (1) (2020)
Carlo Sanna, Jeffrey O. Shallit, Shun Zhang
The Largest Entry in the Inverse of a Vandermonde Matrix. CoRR (2020)
Daniel Gabric, Jeffrey O. Shallit
Avoidance of split overlaps. CoRR (2020)
Jean-Paul Allouche, Jeffrey O. Shallit, Zhi-Xiong Wen, Wen Wu, Jie-Meng Zhang
Sum-free sets generated by the period-k-folding sequences and some Sturmian sequences. Discret. Math. 343 (9) (2020)
Daniel Krenn, Jeffrey O. Shallit
Decidability and k-Regular Sequences. CoRR (2020)
Jason P. Bell, Thomas F. Lidbetter, Jeffrey O. Shallit
Additive Number Theory via Approximation by Regular Languages. Int. J. Found. Comput. Sci. 31 (6) (2020)
Lukas Fleischer, Samin Riasat, Jeffrey O. Shallit
New bounds on antipowers in words. Inf. Process. Lett. 164 (2020)
Jeffrey O. Shallit
Robbins and Ardila meet Berstel. CoRR (2020)
Jeffrey O. Shallit
String Attractors for Automatic Sequences. CoRR (2020)
Lukas Fleischer, Jeffrey O. Shallit
The State Complexity of Lexicographically Smallest Words and Computing Successors. DLT (2020)
Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit
Unique decipherability in formal languages. Theor. Comput. Sci. 804 (2020)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Extremal overlap-free and extremal β-free binary words. CoRR (2020)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Extremal Overlap-Free and Extremal $\beta$-Free Binary Words. Electron. J. Comb. 27 (4) (2020)
Jeffrey O. Shallit
Sumsets of Wythoff Sequences, Fibonacci Representation, and Beyond. CoRR (2020)
Jeffrey O. Shallit
Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture. CoRR (2020)
Aaron Potechin, Jeffrey O. Shallit
Lengths of words accepted by nondeterministic finite automata. Inf. Process. Lett. 162 (2020)
Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula
Existential Length Universality. STACS (2020)
Craig S. Kaplan, Jeffrey O. Shallit
A Frameless 2-Coloring of the Plane Lattice. CoRR (2020)
Lukas Fleischer, Jeffrey O. Shallit
The State Complexity of Lexicographically Smallest Words and Computing Successors. CoRR (2020)
Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith
Additive Number Theory via Automata Theory. Theory Comput. Syst. 64 (3) (2020)

Jeffrey O. Shallit.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jeffrey O. Shallit