Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffrey 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
- 2023
[j150]Robert Cummings, Jeffrey O. Shallit
, Paul Staadecker:
Mesosome avoidance. Inf. Process. Lett. 179: 106291 (2023)- [i129]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Dyck Words, Pattern Avoidance, and Automatic Sequences. CoRR abs/2301.06145 (2023) - 2022
- [j149]Narad Rampersad, Jeffrey O. Shallit:
Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton. Electron. J. Comb. 29(3) (2022) - [j148]Phakhinkon Phunphayap, Prapanpong Pongsriiam, Jeffrey O. Shallit:
Sumsets associated with Beatty sequences. Discret. Math. 345(5): 112810 (2022) - [j147]Daniel Gabric, Stepan Holub, Jeffrey O. Shallit:
Maximal state complexity and generalized de Bruijn words. Inf. Comput. 284: 104689 (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: 3 (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. WORDS 2019: 264-274 - [c72]Daniel Gabric, Stepan Holub, Jeffrey O. Shallit:
Generalized de Bruijn Words and the State Complexity of Conjugate Sets. DCFS 2019: 137-146 - [c71]Antonio Molina Lovett, Jeffrey O. Shallit:
Optimal Regular Expressions for Permutations. ICALP 2019: 121:1-121:12 - [i93]Aseem R. Baranwal, Jeffrey O. Shallit:
Critical exponent of infinite balanced words via the Pell number system. CoRR abs/1902.00503 (2019) - [i92]Daniel Gabric, Stepan Holub, Jeffrey O. Shallit:
Generalized de Bruijn words and the state complexity of conjugate sets. CoRR abs/1903.05442 (2019) - [i91]Trevor Clokie, Daniel Gabric, Jeffrey O. Shallit:
Circularly squarefree words and unbordered conjugates: a new approach. CoRR abs/1904.08187 (2019) - [i90]Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
New results on pseudosquare avoidance. CoRR abs/1904.09157 (2019) - [i89]Aseem Raj Baranwal, Jeffrey O. Shallit:
Repetitions in infinite palindrome-rich words. CoRR abs/1904.10028 (2019) - [i88]Daniel Gabric, Jeffrey O. Shallit:
Borders, Palindrome Prefixes, and Square Prefixes. CoRR abs/1906.03689 (2019) - [i87]Jean-Paul Allouche, Jeffrey O. Shallit:
Automatic sequences are also non-uniformly morphic. CoRR abs/1910.08546 (2019) - [i86]Lukas Fleischer, Jeffrey O. Shallit:
Words Avoiding Reversed Factors, Revisited. CoRR abs/1911.11704 (2019) - [i85]Lukas Fleischer, Jeffrey O. Shallit:
Words With Few Palindromes, Revisited. CoRR abs/1911.12464 (2019) - [i84]Lukas Fleischer, Samin Riasat, Jeffrey O. Shallit:
New Bounds on Antipowers in Binary Words. CoRR abs/1912.08147 (2019) - 2018
- [j116]Jeffrey O. Shallit, Alexander Okhotin:
Preface. Inf. Comput. 259(2): 161 (2018) - [c70]Jason P. Bell, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Additive Number Theory via Approximation by Regular Languages. DLT 2018: 121-132 - [c69]Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Counting Subwords and Regular Languages. DLT 2018: 231-242 - [c68]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters and Caterpillars. ICALP 2018: 18:1-18:15 - [c67]P. Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey O. Shallit:
Lagrange's Theorem for Binary Squares. MFCS 2018: 18:1-18:14 - [c66]Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith:
Sums of Palindromes: an Approach via Automata. STACS 2018: 54:1-54:12 - [i83]Daniel M. Kane, Carlo Sanna, Jeffrey O. Shallit:
Waring's Theorem for Binary Powers. CoRR abs/1801.04483 (2018) - [i82]Narad Rampersad, Jeffrey O. Shallit, Élise Vandomme:
Critical exponents of infinite balanced words. CoRR abs/1801.05334 (2018) - [i81]Jeffrey O. Shallit, Arseny M. Shur:
Subword complexity and power avoidance. CoRR abs/1801.05376 (2018) - [i80]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters and Caterpillars. CoRR abs/1801.08565 (2018) - [i79]Narad Rampersad, Jeffrey O. Shallit:
Common factors in automatic and Sturmian sequences. CoRR abs/1802.00325 (2018) - [i78]Aaron Potechin, Jeffrey O. Shallit:
Lengths of Words Accepted by Nondeterministic Finite Automata. CoRR abs/1802.04708 (2018) - [i77]Jason P. Bell, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Additive Number Theory via Approximation by Regular Languages. CoRR abs/1804.07996 (2018) - [i76]Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Counting Subwords and Regular Languages. CoRR abs/1804.11175 (2018) - [i75]Jeffrey O. Shallit, Ramin Zarifi:
Circular critical exponents for Thue-Morse factors. CoRR abs/1808.02529 (2018) - [i74]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti:
Cobham's Theorem and Automaticity. CoRR abs/1809.00679 (2018) - [i73]Antonio Molina Lovett, Jeffrey O. Shallit:
Optimal Regular Expressions for Permutations. CoRR abs/1812.06347 (2018) - 2017
- [j115]Guilhem Gamard, Gwénaël Richomme, Jeffrey O. Shallit, Taylor J. Smith:
Periodicity in rectangular arrays. Inf. Process. Lett. 118: 58-63 (2017) - [j114]Cezar Câmpeanu, Florin Manea, Giovanni Pighizzini, Jeffrey O. Shallit:
Preface. J. Autom. Lang. Comb. 22(1-3): 3-4 (2017) - [j113]Chen Fei Du, Hamoon Mousavi, Eric Rowland, Luke Schaeffer, Jeffrey O. Shallit:
Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability. Theor. Comput. Sci. 657: 146-162 (2017) - [j112]Gabriele Fici, Filippo Mignosi, Jeffrey O. Shallit:
Abelian-square-rich words. Theor. Comput. Sci. 684: 29-42 (2017) - [c65]Aayush Rajasekaran, Narad Rampersad, Jeffrey O. Shallit:
Overpals, Underlaps, and Underpals. WORDS 2017: 17-29 - [c64]Jörg Endrullis, Jeffrey O. Shallit, Tim Smith:
Undecidability and Finite Automata. DLT 2017: 160-172 - [c63]Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit:
Fractional Coverings, Greedy Coverings, and Rectifier Networks. STACS 2017: 23:1-23:14 - [e3]Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Jeffrey O. Shallit:
The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski. World Scientific 2017, ISBN 978-981-3148-19-2 [contents] - [i72]Gabriele Fici, Filippo Mignosi, Jeffrey O. Shallit:
Abelian-Square-Rich Words. CoRR abs/1701.00948 (2017) - [i71]Sajed Haque, Jeffrey O. Shallit:
A Class of Exponential Sequences with Shift-Invariant Discriminators. CoRR abs/1702.00802 (2017) - [i70]Jörg Endrullis, Jeffrey O. Shallit, Tim Smith:
Undecidability and Finite Automata. CoRR abs/1702.01394 (2017) - [i69]Pawel Gawrychowski, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula:
Existential length universality. CoRR abs/1702.03961 (2017) - [i68]Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith:
Sums of Palindromes: an Approach via Nested-Word Automata. CoRR abs/1706.10206 (2017) - [i67]Andrew Bridy, Robert J. Lemke Oliver, Arlo Shallit, Jeffrey O. Shallit:
The Generalized Nagell-Ljunggren Problem: Powers with Repetitive Representations. CoRR abs/1707.03894 (2017) - [i66]