default search action
Jeffrey O. Shallit
Person information
- affiliation: University of Waterloo, School of Computer Science, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j158]Ali Keramatipour, Jeffrey O. Shallit:
Record-setters in the Stern sequence. Discret. Math. 347(4): 113852 (2024) - [j157]Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic:
Power-free complementary binary morphisms. J. Comb. Theory, Ser. A 207: 105910 (2024) - [j156]Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian words. Log. Methods Comput. Sci. 20(3) (2024) - [j155]Jeffrey O. Shallit:
Proving properties of some greedily-defined integer recurrences via automata theory. Theor. Comput. Sci. 988: 114363 (2024) - [c92]Pierre Popoli, Jeffrey O. Shallit, Manon Stipulanti:
Additive Word Complexity and Walnut. FSTTCS 2024: 32:1-32:18 - [c91]Aaron Barnoff, Curtis Bright, Jeffrey O. Shallit:
Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals. CIAA 2024: 35-50 - [c90]Jozef Jirásek, Galina Jirásková, Jeffrey O. Shallit:
State Complexity of the Minimal Star Basis. CIAA 2024: 195-207 - [i153]Jean-Paul Allouche, Jeffrey O. Shallit, Manon Stipulanti:
Combinatorics on words and generating Dirichlet series of automatic sequences. CoRR abs/2401.13524 (2024) - [i152]Daniel Krenn, Jeffrey O. Shallit:
Strongly k-recursive sequences. CoRR abs/2401.14231 (2024) - [i151]Luke Schaeffer, Jeffrey O. Shallit, Stefan Zorcic:
Beatty Sequences for a Quadratic Irrational: Decidability and Applications. CoRR abs/2402.08331 (2024) - [i150]Jason P. Bell, Christian Schulz, Jeffrey O. Shallit:
Consecutive Power Occurrences in Sturmian Words. CoRR abs/2402.09597 (2024) - [i149]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 abs/2405.02727 (2024) - [i148]Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit:
Repetition Threshold for Binary Automatic Sequences. CoRR abs/2406.06513 (2024) - [i147]Jean-Paul Allouche, John M. Campbell, Jeffrey O. Shallit, Manon Stipulanti:
The reflection complexity of sequences over finite alphabets. CoRR abs/2406.09302 (2024) - [i146]Nicolas Ollinger, Jeffrey O. Shallit:
The Repetition Threshold for Rote Sequences. CoRR abs/2406.17867 (2024) - [i145]Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson:
Some Remarks on Palindromic Periodicities. CoRR abs/2407.10564 (2024) - [i144]Christophe Reutenauer, Jeffrey O. Shallit:
Christoffel Matrices and Sturmian Determinants. CoRR abs/2409.09824 (2024) - [i143]Pierre Popoli, Jeffrey O. Shallit, Manon Stipulanti:
Additive word complexity and Walnut. CoRR abs/2410.02409 (2024) - 2023
- [j154]Jeffrey O. Shallit:
Note on a Fibonacci parity sequence. Cryptogr. Commun. 15(2): 309-315 (2023) - [j153]Robert Cummings, Jeffrey O. Shallit, Paul Staadecker:
Mesosome avoidance. Inf. Process. Lett. 179: 106291 (2023) - [j152]James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. 57: 1 (2023) - [j151]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: 4 (2023) - [c89]Daniel Gabric, Jeffrey O. Shallit:
Smallest and Largest Block Palindrome Factorizations. WORDS 2023: 181-191 - [c88]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Dyck Words, Pattern Avoidance, and Automatic Sequences. WORDS 2023: 220-232 - [c87]Narad Rampersad, Jeffrey O. Shallit:
Rudin-Shapiro Sums via Automata Theory and Logic. WORDS 2023: 233-246 - [c86]Jeffrey O. Shallit:
Proving Results About OEIS Sequences with Walnut. CICM 2023: 270-282 - [c85]Jeffrey O. Shallit, Anatoly Zavyalov:
Transduction of Automatic Sequences and Applications. CIAA 2023: 266-277 - [c84]Jeffrey O. Shallit, Sonja Linghui Shan:
A General Approach to Proving Properties of Fibonacci Representations via Automata Theory. AFL 2023: 228-242 - [i142]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Dyck Words, Pattern Avoidance, and Automatic Sequences. CoRR abs/2301.06145 (2023) - [i141]Jeffrey O. Shallit:
Proof of a conjecture of Krawchuk and Rampersad. CoRR abs/2301.11473 (2023) - [i140]Narad Rampersad, Jeffrey O. Shallit:
Rudin-Shapiro Sums Via Automata Theory and Logic. CoRR abs/2302.00405 (2023) - [i139]Jeffrey O. Shallit:
A Dombi Counterexample with Positive Lower Density. CoRR abs/2302.02138 (2023) - [i138]Jeffrey O. Shallit:
Prefixes of the Fibonacci word. CoRR abs/2302.04640 (2023) - [i137]Jeffrey O. Shallit:
Rarefied Thue-Morse Sums Via Automata Theory and Logic. CoRR abs/2302.09436 (2023) - [i136]Daniel Gabric, Jeffrey O. Shallit:
Smallest and Largest Block Palindrome Factorizations. CoRR abs/2302.13147 (2023) - [i135]Jeffrey O. Shallit, Anatoly Zavyalov:
Transduction of Automatic Sequences and Applications. CoRR abs/2303.15203 (2023) - [i134]Jeffrey O. Shallit:
Proving Properties of φ-Representations with the Walnut Theorem-Prover. CoRR abs/2305.02672 (2023) - [i133]Jeffrey O. Shallit:
Proving properties of some greedily-defined integer recurrences via automata theory. CoRR abs/2308.06544 (2023) - [i132]Jeffrey O. Shallit:
Proof of Irvine's Conjecture via Mechanized Guessing. CoRR abs/2310.14252 (2023) - [i131]Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic:
New constructions for 3-free and 3+-free binary morphisms. CoRR abs/2310.15064 (2023) - [i130]Jeffrey O. Shallit, Xinhao Xu:
Repetition factorization of automatic sequences. CoRR abs/2311.14961 (2023) - [i129]Benoit Cloitre, Jeffrey O. Shallit:
Some Fibonacci-Related Sequences. CoRR abs/2312.11706 (2023) - 2022
- [j150]Narad Rampersad, Jeffrey O. Shallit:
Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton. Electron. J. Comb. 29(3) (2022) - [j149]Phakhinkon Phunphayap, Prapanpong Pongsriiam, Jeffrey O. Shallit:
Sumsets associated with Beatty sequences. Discret. Math. 345(5): 112810 (2022) - [j148]Daniel Gabric, Stepan Holub, Jeffrey O. Shallit:
Maximal state complexity and generalized de Bruijn words. Inf. Comput. 284: 104689 (2022) - [j147]Jason P. Bell, Jeffrey O. Shallit:
Automatic sequences of rank two. RAIRO Theor. Informatics Appl. 56: 7 (2022) - [j146]Jeffrey O. Shallit:
Sumsets of Wythoff sequences, Fibonacci representation, and beyond. Period. Math. Hung. 84(1): 37-46 (2022) - [j145]Daniel Krenn, Jeffrey O. Shallit:
Decidability and k-regular sequences. Theor. Comput. Sci. 907: 34-44 (2022) - [j144]Gabriele Fici, Jeffrey O. Shallit:
Properties of a class of Toeplitz words. Theor. Comput. Sci. 922: 1-12 (2022) - [j143]Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman:
Computational aspects of sturdy and flimsy numbers. Theor. Comput. Sci. 927: 65-86 (2022) - [j142]Jason P. Bell, Jeffrey O. Shallit:
Lie complexity of words. Theor. Comput. Sci. 927: 98-108 (2022) - [c83]Jeffrey O. Shallit:
Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk). CPM 2022: 2:1-2:3 - [c82]Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian Words. CSL 2022: 24:1-24:23 - [i128]James Haoyu Bai, Joseph Meleshko, Samin Riasat, Jeffrey O. Shallit:
Quotients of Palindromic and Antipalindromic Numbers. CoRR abs/2202.13694 (2022) - [i127]Jeffrey O. Shallit:
Intertwining of Complementary Thue-Morse Factors. CoRR abs/2203.02917 (2022) - [i126]Jeffrey O. Shallit:
Note on a Fibonacci Parity Sequence. CoRR abs/2203.10504 (2022) - [i125]James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Properties of a Ternary Infinite Word. CoRR abs/2206.01776 (2022) - [i124]Joseph Meleshko, Pascal Ochem, Jeffrey O. Shallit, Sonja Linghui Shan:
Pseudoperiodic Words and a Question of Shevelev. CoRR abs/2207.10171 (2022) - [i123]Jeffrey O. Shallit, Sonja Linghui Shan, Kai-Hsiang Yang:
Automatic Sequences in Negative Bases and Proofs of Some Conjectures of Shevelev. CoRR abs/2208.06025 (2022) - [i122]Luke Schaeffer, Jeffrey O. Shallit:
The First-Order Theory of Binary Overlap-Free Words is Decidable. CoRR abs/2209.03266 (2022) - [i121]Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Antisquares and Critical Exponents. CoRR abs/2209.09223 (2022) - [i120]James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Complement Avoidance in Binary Words. CoRR abs/2209.09598 (2022) - [i119]Jeffrey O. Shallit:
Some Tribonacci Conjectures. CoRR abs/2210.03996 (2022) - [i118]Jason P. Bell, Jeffrey O. Shallit:
Counterexamples to a Conjecture of Dombi in Additive Number Theory. CoRR abs/2212.12473 (2022) - 2021
- [j141]Daniel Gabric, Jeffrey O. Shallit, Xiaofeng Zhong:
Avoidance of split overlaps. Discret. Math. 344(2): 112176 (2021) - [j140]Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit:
An Inequality for the Number of Periods in a Word. Int. J. Found. Comput. Sci. 32(5): 597-614 (2021) - [j139]Lukas Fleischer, Jeffrey O. Shallit:
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages. Int. J. Found. Comput. Sci. 32(6): 641-662 (2021) - [j138]Daniel Gabric, Jeffrey O. Shallit:
Borders, palindrome prefixes, and square prefixes. Inf. Process. Lett. 165: 106027 (2021) - [j137]Jeffrey O. Shallit:
Robbins and Ardila meet Berstel. Inf. Process. Lett. 167: 106081 (2021) - [j136]Daniel Gabric, Jeffrey O. Shallit:
The simplest binary word with only three squares. RAIRO Theor. Informatics Appl. 55: 1-7 (2021) - [j135]Lukas Fleischer, Jeffrey O. Shallit:
Automata, Palindromes, and Reversed Subwords. J. Autom. Lang. Comb. 26(3-4): 221-253 (2021) - [j134]Aseem R. Baranwal, Luke Schaeffer, Jeffrey O. Shallit:
Ostrowski-automatic sequences: Theory and applications. Theor. Comput. Sci. 858: 122-142 (2021) - [c81]Jeffrey O. Shallit:
Synchronized Sequences. WORDS 2021: 1-19 - [c80]Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman:
Computational Fun with Sturdy and Flimsy Numbers. FUN 2021: 10:1-10:21 - [c79]Jeffrey O. Shallit:
Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs. CIAA 2021: 14-24 - [p2]Hermann Gruber, Jonathan Lee, Jeffrey O. Shallit:
Enumerating regular expressions and their languages. Handbook of Automata Theory (I.) 2021: 459-491 - [i117]Jason P. Bell, Jeffrey O. Shallit:
Lie complexity of words. CoRR abs/2102.03821 (2021) - [i116]Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian words. CoRR abs/2102.08207 (2021) - [i115]Jeffrey O. Shallit:
Frobenius Numbers and Automatic Sequences. CoRR abs/2103.10904 (2021) - [i114]Jeffrey O. Shallit:
Hilbert's spacefilling curve described by automatic, regular, and synchronized sequences. CoRR abs/2106.01062 (2021) - [i113]Robert Cummings, Jeffrey O. Shallit, Paul Staadecker:
Mesosome Avoidance. CoRR abs/2107.13813 (2021) - [i112]Jason P. Bell, Jeffrey O. Shallit:
Automatic Sequences of Rank Two. CoRR abs/2108.05434 (2021) - [i111]Narad Rampersad, Jeffrey O. Shallit:
Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton. CoRR abs/2110.06244 (2021) - [i110]James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers. CoRR abs/2111.07857 (2021) - [i109]Gabriele Fici, Jeffrey O. Shallit:
Properties of a Class of Toeplitz Words. CoRR abs/2112.12125 (2021) - [i108]Jeffrey O. Shallit:
Additive Number Theory via Automata and Logic. CoRR abs/2112.13627 (2021) - 2020
- [j133]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): 1 (2020) - [j132]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extremal Overlap-Free and Extremal $\beta$-Free Binary Words. Electron. J. Comb. 27(4): 4 (2020) - [j131]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): 111958 (2020) - [j130]Jason P. Bell, Thomas F. Lidbetter, Jeffrey O. Shallit:
Additive Number Theory via Approximation by Regular Languages. Int. J. Found. Comput. Sci. 31(6): 667-687 (2020) - [j129]Aaron Potechin, Jeffrey O. Shallit:
Lengths of words accepted by nondeterministic finite automata. Inf. Process. Lett. 162: 105993 (2020) - [j128]Lukas Fleischer, Samin Riasat, Jeffrey O. Shallit:
New bounds on antipowers in words. Inf. Process. Lett. 164: 106021 (2020) - [j127]Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith:
Additive Number Theory via Automata Theory. Theory Comput. Syst. 64(3): 542-567 (2020) - [j126]Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit:
Unique decipherability in formal languages. Theor. Comput. Sci. 804: 149-160 (2020) - [c78]Lukas Fleischer, Jeffrey O. Shallit:
The State Complexity of Lexicographically Smallest Words and Computing Successors. DLT 2020: 83-95 - [c77]Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula:
Existential Length Universality. STACS 2020: 16:1-16:14 - [i107]Daniel Gabric, Jeffrey O. Shallit:
Avoidance of split overlaps. CoRR abs/2002.01968 (2020) - [i106]Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman:
Computational Aspects of Sturdy and Flimsy Numbers. CoRR abs/2002.02731 (2020) - [i105]Lukas Fleischer, Jeffrey O. Shallit:
The State Complexity of Lexicographically Smallest Words and Computing Successors. CoRR abs/2003.08249 (2020) - [i104]Daniel Krenn, Jeffrey O. Shallit:
Decidability and k-Regular Sequences. CoRR abs/2005.09507 (2020) - [i103]Craig S. Kaplan, Jeffrey O. Shallit:
A Frameless 2-Coloring of the Plane Lattice. CoRR abs/2005.09585 (2020) - [i102]Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit:
An inequality for the number of periods in a word. CoRR abs/2005.11718 (2020) - [i101]Jeffrey O. Shallit:
Sumsets of Wythoff Sequences, Fibonacci Representation, and Beyond. CoRR abs/2006.04177 (2020) - [i100]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extremal overlap-free and extremal β-free binary words. CoRR abs/2006.10152 (2020) - [i99]Daniel Gabric, Jeffrey O. Shallit:
The Simplest Binary Word with Only Three Squares. CoRR abs/2007.08188 (2020) - [i98]Jeffrey O. Shallit:
Robbins and Ardila meet Berstel. CoRR abs/2007.14930 (2020) - [i97]Carlo Sanna, Jeffrey O. Shallit, Shun Zhang:
The Largest Entry in the Inverse of a Vandermonde Matrix. CoRR abs/2008.01012 (2020) - [i96]Jeffrey O. Shallit:
Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture. CoRR abs/2010.10956 (2020) - [i95]Jeffrey O. Shallit:
Abelian Complexity and Synchronization. CoRR abs/2011.00453 (2020) - [i94]Jeffrey O. Shallit:
String Attractors for Automatic Sequences. CoRR abs/2012.06840 (2020)
2010 – 2019
- 2019
- [j125]Daniel M. Kane, Carlo Sanna, Jeffrey O. Shallit:
Waring's Theorem for Binary Powers. Comb. 39(6): 1335-1350 (2019) - [j124]Lukas Spiegelhofer, Jeffrey O. Shallit:
Continuants, Run Lengths, and Barry's Modified Pascal Triangle. Electron. J. Comb. 26(1): 1 (2019) - [j123]Andrew Bridy, Robert J. Lemke Oliver, Arlo Shallit, Jeffrey O. Shallit:
The Generalized Nagell-Ljunggren Problem: Powers with Repetitive Representations. Exp. Math. 28(4): 428-439 (2019) - [j122]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti:
Cobham's Theorem and Automaticity. Int. J. Found. Comput. Sci. 30(8): 1363-1379 (2019) - [j121]Jeffrey O. Shallit, Ramin Zarifi:
Circular critical exponents for Thue-Morse factors. RAIRO Theor. Informatics Appl. 53(1-2): 37-49 (2019) - [j120]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters: Long Sequences without Short Runs. SIAM J. Discret. Math. 33(2): 845-861 (2019) - [j119]Pierre Bonardo, Anna E. Frid, Jeffrey O. Shallit:
The number of valid factorizations of Fibonacci prefixes. Theor. Comput. Sci. 775: 68-75 (2019) - [j118]Narad Rampersad, Jeffrey O. Shallit, Élise Vandomme:
Critical exponents of infinite balanced words. Theor. Comput. Sci. 777: 454-463 (2019) - [j117]Jeffrey O. Shallit, Arseny M. Shur:
Subword complexity and power avoidance. Theor. Comput. Sci. 792: 96-116 (2019) - [c76]Aseem R. Baranwal, Jeffrey O. Shallit:
Critical Exponent of Infinite Balanced Words via the Pell Number System. WORDS 2019: 80-92 - [c75]Aseem R. Baranwal, Jeffrey O. Shallit:
Repetitions in Infinite Palindrome-Rich Words. WORDS 2019: 93-105 - [c74]Trevor Clokie, Daniel Gabric, Jeffrey O. Shallit:
Circularly Squarefree Words and Unbordered Conjugates: A New Approach. WORDS 2019: 133-144 - [c73]Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
New Results on Pseudosquare Avoidance.