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
- 2025
[j163]Jean-Paul Allouche, Jeffrey O. Shallit, Manon Stipulanti:
Combinatorics on words and generating Dirichlet series of automatic sequences. Discret. Math. 348(8): 114487 (2025)- [j162]Narad Rampersad, Jeffrey O. Shallit:
Rudin-Shapiro Sums Via Automata Theory and Logic. Theory Comput. Syst. 69(1): 9 (2025) - [c93]Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson:
On Palindromic Periodicities. CPM 2025: 11:1-11:14 - [i159]Jeffrey O. Shallit:
Cloitre's Self-Generating Sequence. CoRR abs/2501.00784 (2025) - [i158]Jeffrey O. Shallit:
The Hurt-Sada Array and Zeckendorf Representations. CoRR abs/2501.08823 (2025) - [i157]Jeffrey O. Shallit:
An 'Experimental Mathematics' Approach to Stolarsky Interspersions via Automata Theory. CoRR abs/2502.03312 (2025) - [i156]Jeffrey O. Shallit:
The Narayana Morphism and Related Words. CoRR abs/2503.01026 (2025) - [i155]Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger, Pierre Popoli, Jeffrey O. Shallit, Manon Stipulanti:
Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences. CoRR abs/2504.13584 (2025) - 2024
- [j161]Ali Keramatipour, Jeffrey O. Shallit
:
Record-setters in the Stern sequence. Discret. Math. 347(4): 113852 (2024) - [j160]Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic:
Power-free complementary binary morphisms. J. Comb. Theory, Ser. A 207: 105910 (2024) - [j159]Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian words. Log. Methods Comput. Sci. 20(3) (2024) - [j158]James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers. SIAM J. Discret. Math. 38(4): 2913-2925 (2024) - [j157]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 - [i154]Jean-Paul Allouche, Jeffrey O. Shallit, Manon Stipulanti:
Combinatorics on words and generating Dirichlet series of automatic sequences. CoRR abs/2401.13524 (2024) - [i153]Daniel Krenn, Jeffrey O. Shallit:
Strongly k-recursive sequences. CoRR abs/2401.14231 (2024) - [i152]Luke Schaeffer, Jeffrey O. Shallit, Stefan Zorcic:
Beatty Sequences for a Quadratic Irrational: Decidability and Applications. CoRR abs/2402.08331 (2024) - [i151]Jason P. Bell, Christian Schulz, Jeffrey O. Shallit:
Consecutive Power Occurrences in Sturmian Words. CoRR abs/2402.09597 (2024) - [i150]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) - [i149]Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit:
Repetition Threshold for Binary Automatic Sequences. CoRR abs/2406.06513 (2024) - [i148]Jean-Paul Allouche, John M. Campbell, Jeffrey O. Shallit, Manon Stipulanti:
The reflection complexity of sequences over finite alphabets. CoRR abs/2406.09302 (2024) - [i147]Nicolas Ollinger, Jeffrey O. Shallit:
The Repetition Threshold for Rote Sequences. CoRR abs/2406.17867 (2024) - [i146]Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson:
Some Remarks on Palindromic Periodicities. CoRR abs/2407.10564 (2024) - [i145]Christophe Reutenauer, Jeffrey O. Shallit:
Christoffel Matrices and Sturmian Determinants. CoRR abs/2409.09824 (2024) - [i144]Pierre Popoli, Jeffrey O. Shallit, Manon Stipulanti:
Additive word complexity and Walnut. CoRR abs/2410.02409 (2024) - [i143]Jeffrey O. Shallit:
Runs in Paperfolding Sequences. CoRR abs/2412.17930 (2024) - 2023
- [j156]Jeffrey O. Shallit:
Note on a Fibonacci parity sequence. Cryptogr. Commun. 15(2): 309-315 (2023) - [j155]Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Antisquares and Critical Exponents. Discret. Math. Theor. Comput. Sci. 25(2) (2023) - [j154]Joseph Meleshko, Pascal Ochem, Jeffrey O. Shallit, Sonja Linghui Shan:
Pseudoperiodic Words and a Question of Shevelev. Discret. Math. Theor. Comput. Sci. 25(2) (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. 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]Parthasarathy Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey O. Shallit:
Lagrange's Theorem for Binary Squares. CoRR abs/1710.04247 (2017) - [i65]Jason P. Bell, Kathryn Hare, Jeffrey O. Shallit:
When is an automatic set an additive basis? CoRR abs/1710.08353 (2017) - [i64]I. P. Goulden, L. Bruce Richmond, Jeffrey O. Shallit:
Disjoint covering systems and the reversion of the Möbius series. CoRR abs/1711.04109 (2017) - [i63]Jean-Paul Allouche, Julien Cassaigne, Jeffrey O. Shallit, Luca Q. Zamboni:
A Taxonomy of Morphic Sequences. CoRR abs/1711.10807 (2017) - 2016
- [j111]Luke Schaeffer, Jeffrey O. Shallit:
Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences. Electron. J. Comb. 23(1): 1 (2016) - [j110]Curtis Bright, Raymond Devillers, Jeffrey O. Shallit:
Minimal Elements for the Prime Numbers. Exp. Math. 25(3): 321-331 (2016) - [j109]Michael Forsyth, Amlesh Jayakumar, Jarkko Peltomäki, Jeffrey O. Shallit:
Remarks on Privileged Words. Int. J. Found. Comput. Sci. 27(4): 431-442 (2016) - [j108]Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties. Int. J. Found. Comput. Sci. 27(8): 943-964 (2016) - [j107]Sajed Haque, Jeffrey O. Shallit:
Discriminators and k-Regular Sequences. Integers 16: A76 (2016) - [j106]Chuan Guo, Jeffrey O. Shallit, Arseny M. Shur:
Palindromic rich words and run-length encodings. Inf. Process. Lett. 116(12): 735-738 (2016) - [j105]Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
Decision algorithms for Fibonacci-automatic Words, I: Basic results. RAIRO Theor. Informatics Appl. 50(1): 39-66 (2016) - [c62]Stepan Holub, Jeffrey O. Shallit:
Periods and Borders of Random Words. STACS 2016: 44:1-44:10 - [e2]Cezar Câmpeanu, Florin Manea, Jeffrey O. Shallit:
Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings. Lecture Notes in Computer Science 9777, Springer 2016, ISBN 978-3-319-41113-2 [contents] - [i62]Jeffrey O. Shallit, Taylor J. Smith:
Periodicity in Rectangular Arrays. CoRR abs/1602.06915 (2016) - [i61]Sajed Haque, Jeffrey O. Shallit:
Discriminators and k-Regular Sequences. CoRR abs/1605.00092 (2016) - [i60]Jean-Paul Allouche, Jeffrey O. Shallit:
On the subword complexity of the fixed point of $a \rightarrow aab$, $b \rightarrow b$, and generalizations. CoRR abs/1605.02361 (2016) - [i59]Jeffrey O. Shallit:
Length of the continued logarithm algorithm on rational inputs. CoRR abs/1606.03881 (2016) - [i58]Jeffrey O. Shallit:
Minimum Critical Exponents for Palindromes. CoRR abs/1612.05320 (2016) - 2015
- [j104]Eric Rowland, Jeffrey O. Shallit:
Automatic Sets of Rational Numbers. Int. J. Found. Comput. Sci. 26(3): 343-366 (2015) - [j103]Chen Fei Du, Jeffrey O. Shallit, Arseny M. Shur:
Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words. Int. J. Found. Comput. Sci. 26(8): 1147-1166 (2015) - [c61]Daniel Goc, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
A New Approach to the Paperfolding Sequences. CiE 2015: 34-43 - [c60]Hamoon Mousavi, Jeffrey O. Shallit:
Mechanical Proofs of Properties of the Tribonacci Word. WORDS 2015: 170-190 - [c59]Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit:
Factorization in Formal Languages. DLT 2015: 97-107 - [e1]Jeffrey O. Shallit, Alexander Okhotin:
Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings. Lecture Notes in Computer Science 9118, Springer 2015, ISBN 978-3-319-19224-6 [contents] - [i57]Paul Bell, Daniel Reidenbach, Jeffrey O. Shallit:
Factorization in Formal Languages. CoRR abs/1503.06365 (2015) - [i56]Chuan Guo, Jeffrey O. Shallit, Arseny M. Shur:
On the Combinatorics of Palindromes and Antipalindromes. CoRR abs/1503.09112 (2015) - [i55]Luke Schaeffer, Jeffrey O. Shallit:
Closed, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences. CoRR abs/1508.02074 (2015) - [i54]Stepan Holub, Jeffrey O. Shallit:
Periods and borders of random words. CoRR abs/1509.05240 (2015) - [i53]Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit:
Fractional coverings, greedy coverings, and rectifier networks. CoRR abs/1509.07588 (2015) - [i52]Robbert J. Fokkink, Cor Kraaikamp, Jeffrey O. Shallit:
Hankel Matrices for the Period-Doubling Sequence. CoRR abs/1511.06569 (2015) - 2014
- [j102]L. Bruce Richmond, Jeffrey O. Shallit:
Counting the Palstars. Electron. J. Comb. 21(3): 3 (2014) - [j101]Jeffrey O. Shallit:
Reviewing the Early Days of Computing [Book Review]. Comput. Sci. Eng. 16(6): 8-9 (2014) - [j100]Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit:
Avoiding Three Consecutive Blocks of the Same Size and Same Sum. J. ACM 61(2): 10:1-10:17 (2014) - [c58]Chen Fei Du, Jeffrey O. Shallit:
Similarity density of the Thue-Morse word with overlap-free infinite binary words. AFL 2014: 231-245 - [i51]Christopher Drexler-Lemire, Jeffrey O. Shallit:
Notes and Note-Pairs in Noergaard's Infinity Series. CoRR abs/1402.3091 (2014) - [i50]Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance. CoRR abs/1406.0670 (2014) - [i49]Hamoon Mousavi, Jeffrey O. Shallit:
Mechanical Proofs of Properties of the Tribonacci Word. CoRR abs/1407.5841 (2014) - 2013
- [j99]Alexander Leong, Jeffrey O. Shallit:
Counting Sequences with Small Discrepancies. Exp. Math. 22(1): 74-84 (2013) - [j98]Hamoon Mousavi, Jeffrey O. Shallit:
Filtrations of Formal Languages by Arithmetic Progressions. Fundam. Informaticae 123(2): 135-142 (2013) - [j97]Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit:
Composition and orbits of language operations: finiteness and upper bounds. Int. J. Comput. Math. 90(6): 1171-1196 (2013) - [j96]Daniel Goc, Dane Henshall, Jeffrey O. Shallit:
Automatic Theorem-Proving in Combinatorics on Words. Int. J. Found. Comput. Sci. 24(6): 781-798 (2013) - [j95]Jeffrey O. Shallit:
Review of computability and complexity theory by Steven Homer and Alan L. Selman. SIGACT News 44(4): 41-42 (2013) - [c57]Jeffrey O. Shallit:
Decidability and Enumeration for Automatic Sequences: A Survey. CSR 2013: 49-63 - [c56]Shuo Tan, Jeffrey O. Shallit:
Sets Represented as the Length-n Factors of a Word. WORDS 2013: 250-261 - [c55]Hamoon Mousavi, Jeffrey O. Shallit:
Shortest Repetition-Free Words Accepted by Automata. DCFS 2013: 182-193 - [c54]Daniel Goc, Luke Schaeffer, Jeffrey O. Shallit:
Subword Complexity and k-Synchronization. Developments in Language Theory 2013: 252-263 - [c53]Hamoon Mousavi, Jeffrey O. Shallit:
Repetition Avoidance in Circular Factors. Developments in Language Theory 2013: 384-395 - [c52]Daniel Goc, Hamoon Mousavi, Jeffrey O. Shallit:
On the Number of Unbordered Factors. LATA 2013: 299-310 - [c51]Daniel Goc, Kalle Saari, Jeffrey O. Shallit:
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences. LATA 2013: 311-322 - [p1]Jeffrey O. Shallit:
Description of Generalized Continued Fractions by Finite Automata. Number Theory and Related Fields 2013: 321-339 - [i48]Hamoon Mousavi, Jeffrey O. Shallit:
Shortest Repetition-Free Words Accepted by Automata. CoRR abs/1304.2959 (2013) - [i47]Shuo Tan, Jeffrey O. Shallit:
Sets Represented as the Length-n Factors of a Word. CoRR abs/1304.3666 (2013) - [i46]Jeffrey O. Shallit:
Counting Palstars. CoRR abs/1311.2318 (2013) - [i45]Michael Forsyth, Amlesh Jayakumar, Jeffrey O. Shallit:
Remarks on Privileged Words. CoRR abs/1311.7403 (2013) - 2012
- [j94]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey O. Shallit:
Sturmian graphs and integer representations over numeration systems. Discret. Appl. Math. 160(4-5): 536-547 (2012) - [j93]Eric Rowland, Jeffrey O. Shallit:
Avoiding 3/2-powers over the natural numbers. Discret. Math. 312(6): 1282-1288 (2012) - [j92]Dane Henshall, Narad Rampersad, Jeffrey O. Shallit:
Shuffling and Unshuffling. Bull. EATCS 107: 131-142 (2012) - [j91]Narad Rampersad, Jeffrey O. Shallit, Zhi Xu:
The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages. Fundam. Informaticae 116(1-4): 223-236 (2012) - [j90]Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit:
Enumeration and Decidable Properties of Automatic Sequences. Int. J. Found. Comput. Sci. 23(5): 1035-1066 (2012) - [j89]Luke Schaeffer, Jeffrey O. Shallit:
The Critical Exponent is Computable for Automatic Sequences. Int. J. Found. Comput. Sci. 23(8): 1611-1626 (2012) - [j88]Jeffrey O. Shallit:
Review of finite fields and applications by Gary L. Mullen and Carl Mummert. SIGACT News 43(1): 30-31 (2012) - [j87]Jeffrey O. Shallit:
Review of biscuits of number theory by Arthur T. Benjamin and Ezra Brown. SIGACT News 43(2): 21-24 (2012) - [c50]Galina Jirásková, Jeffrey O. Shallit:
The State Complexity of Star-Complement-Star. Developments in Language Theory 2012: 380-391 - [c49]Eric Rowland, Jeffrey O. Shallit:
k-Automatic Sets of Rational Numbers. LATA 2012: 490-501 - [c48]Daniel Goc, Dane Henshall, Jeffrey O. Shallit:
Automatic Theorem-Proving in Combinatorics on Words. CIAA 2012: 180-191 - [i44]Dane Henshall, Jeffrey O. Shallit:
Automatic Theorem-Proving in Combinatorics on Words. CoRR abs/1203.3758 (2012) - [i43]Galina Jirásková, Jeffrey O. Shallit:
The state complexity of star-complement-star. CoRR abs/1203.5353 (2012) - [i42]Hermann Gruber, Jonathan Lee, Jeffrey O. Shallit:
Enumerating regular expressions and their languages. CoRR abs/1204.4982 (2012) - [i41]Daniel Goc, Luke Schaeffer, Jeffrey O. Shallit:
The Subword Complexity of k-Automatic Sequences is k-Synchronized. CoRR abs/1206.5352 (2012) - [i40]Daniel Goc, Jeffrey O. Shallit:
Primitive Words and Lyndon Words in Automatic Sequences. CoRR abs/1207.5124 (2012) - [i39]Daniel Goc, Jeffrey O. Shallit:
Least periods of k-automatic sequences. CoRR abs/1207.5450 (2012) - [i38]Daniel Goc, Hamoon Mousavi, Jeffrey O. Shallit:
On the Number of Unbordered Factors. CoRR abs/1211.1301 (2012) - [i37]Hamoon Mousavi, Jeffrey O. Shallit:
Repetition Avoidance in Circular Factors. CoRR abs/1212.0052 (2012) - 2011
- [j86]Michael Coons, Jeffrey O. Shallit:
A pattern sequence approach to Stern's sequence. Discret. Math. 311(22): 2630-2633 (2011) - [j85]Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu:
Decision problems for convex languages. Inf. Comput. 209(3): 353-367 (2011) - [j84]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages and Kuratowski's Theorem. Int. J. Found. Comput. Sci. 22(2): 301-321 (2011) - [j83]Jeffrey O. Shallit, James Stankewicz:
Unbounded Discrepancy in Frobenius Numbers. Integers 11: A2 (2011) - [j82]Yu Hin Au, Aaron Robertson, Jeffrey O. Shallit:
Van der Waerden's Theorem and Avoidability in Words. Integers 11: A7 (2011) - [j81]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Inverse star, borders, and palstars. Inf. Process. Lett. 111(9): 420-422 (2011) - [j80]Wesley R. Elsberry, Jeffrey O. Shallit:
Information theory, evolutionary computation, and Dembski's "complex specified information". Synth. 178(2): 237-270 (2011) - [c47]Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey O. Shallit:
Decidability and Shortest Strings in Formal Languages. DCFS 2011: 55-67 - [c46]Erik D. Demaine, Sarah Eisenstat, Jeffrey O. Shallit, David A. Wilson:
Remarks on Separating Words. DCFS 2011: 147-157 - [c45]Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit:
Enumeration and Decidable Properties of Automatic Sequences. Developments in Language Theory 2011: 165-179 - [c44]Jeffrey O. Shallit:
Fife's Theorem Revisited. Developments in Language Theory 2011: 397-405 - [c43]Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit:
Finite Orbits of Language Operations. LATA 2011: 204-215 - [c42]Narad Rampersad, Jeffrey O. Shallit, Arseny M. Shur:
Fife's Theorem for (7/3)-Powers. WORDS 2011: 189-198 - [c41]Jeffrey O. Shallit:
The Critical Exponent is Computable for Automatic Sequences. WORDS 2011: 231-239 - [i36]Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit:
Finite Orbits of Language Operations. CoRR abs/1101.1667 (2011) - [i35]Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit:
Enumeration and Decidable Properties of Automatic Sequences. CoRR abs/1102.3698 (2011) - [i34]Jeffrey O. Shallit:
Fife's Theorem Revisited. CoRR abs/1102.3932 (2011) - [i33]Jean-Paul Allouche, Jeffrey O. Shallit:
A variant of Hofstadter's sequence and finite automata. CoRR abs/1103.1133 (2011) - [i32]Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey O. Shallit:
Decidability and Shortest Strings in Formal Languages. CoRR abs/1103.1622 (2011) - [i31]Erik D. Demaine, Sarah Eisenstat, Jeffrey O. Shallit, David A. Wilson:
Remarks on separating words. CoRR abs/1103.4513 (2011) - [i30]Michael Coons, Jeffrey O. Shallit:
A Pattern Sequence Approach to Stern's Sequence. CoRR abs/1105.0086 (2011) - [i29]Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit:
Avoiding Three Consecutive Blocks of the Same Size and Same Sum. CoRR abs/1106.5204 (2011) - [i28]Narad Rampersad, Jeffrey O. Shallit:
Shuffling and Unshuffling. CoRR abs/1106.5767 (2011) - [i27]Eric Rowland, Jeffrey O. Shallit:
k-Automatic sets of rational numbers. CoRR abs/1110.2382 (2011) - [i26]Hamoon Mousavi, Jeffrey O. Shallit:
Filtrations of Formal Languages by Arithmetic Progressions. CoRR abs/1112.3758 (2011) - 2010
- [j79]Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit:
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time. Int. J. Found. Comput. Sci. 21(4): 597-618 (2010) - [j78]Narad Rampersad, Jeffrey O. Shallit:
Detecting patterns in finite regular and context-free languages. Inf. Process. Lett. 110(3): 108-112 (2010) - [j77]Jeffrey O. Shallit:
Cryptographic applications of analytic number theory: lower bounds and pseudorandomness author of book: Igor Shparlinski Birkäuser, 2003. SIGACT News 41(3): 44-45 (2010) - [c40]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey O. Shallit:
On Lazy Representations and Sturmian Graphs. CIAA 2010: 125-134 - [i25]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Inverse Star, Borders, and Palstars. CoRR abs/1008.2440 (2010)
2000 – 2009
- 2009
- [j76]L. Bruce Richmond, Jeffrey O. Shallit:
Counting Abelian Squares. Electron. J. Comb. 16(1) (2009) - [j75]Jeffrey O. Shallit:
Hamming distance for conjugates. Discret. Math. 309(12): 4197-4199 (2009) - [j74]Mathieu Guay-Paquet, Jeffrey O. Shallit:
Avoiding squares and overlaps over the natural numbers. Discret. Math. 309(21): 6245-6254 (2009) - [j73]Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Detecting palindromes, patterns and borders in regular languages. Inf. Comput. 207(11): 1096-1118 (2009) - [j72]Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey O. Shallit:
Decimations of languages and state complexity. Theor. Comput. Sci. 410(24-25): 2401-2409 (2009) - [j71]Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit, Bala Ravikumar:
State complexity of unique rational operations. Theor. Comput. Sci. 410(24-25): 2431-2441 (2009) - [j70]Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit:
Periodicity, repetitions, and orbits of an automatic sequence. Theor. Comput. Sci. 410(30-32): 2795-2803 (2009) - [j69]Margareta Ackerman, Jeffrey O. Shallit:
Efficient enumeration of words in regular languages. Theor. Comput. Sci. 410(37): 3461-3470 (2009) - [j68]Jui-Yi Kao, Narad Rampersad, Jeffrey O. Shallit:
On NFAs where all states are final, initial, or both. Theor. Comput. Sci. 410(47-49): 5010-5021 (2009) - [c39]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages and Kuratowski's Theorem. Developments in Language Theory 2009: 125-144 - [c38]Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu:
Decision Problems for Convex Languages. LATA 2009: 247-258 - [i24]Mathieu Guay-Paquet, Jeffrey O. Shallit:
Avoiding Squares and Overlaps Over the Natural Numbers. CoRR abs/0901.1397 (2009) - [i23]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages and Kuratowski's Theorem. CoRR abs/0901.3761 (2009) - [i22]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages: Concatenation, Separation, and Algorithms. CoRR abs/0901.3763 (2009) - [i21]Narad Rampersad, Jeffrey O. Shallit:
Detecting patterns in finite regular and context-free languages. CoRR abs/0906.3220 (2009) - [i20]Narad Rampersad, Jeffrey O. Shallit, Zhi Xu:
The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages. CoRR abs/0907.0159 (2009) - [i19]Thomas Ang, Jeffrey O. Shallit:
Length of the Shortest Word in the Intersection of Regular Languages. CoRR abs/0910.1528 (2009) - [i18]Thomas Ang, Giovanni Pighizzini, Narad Rampersad, Jeffrey O. Shallit:
Automata and Reduced Words in the Free Group. CoRR abs/0910.4555 (2009) - 2008
- [b2]Jeffrey O. Shallit:
A Second Course in Formal Languages and Automata Theory. Cambridge University Press 2008, ISBN 978-0-521-86572-2, pp. I-XI, 1-240 - [j67]Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Avoiding Approximate Squares. Int. J. Found. Comput. Sci. 19(3): 633-648 (2008) - [j66]Jui-Yi Kao, Narad Rampersad, Jeffrey O. Shallit, Manuel Silva:
Words avoiding repetitions in arithmetic progressions. Theor. Comput. Sci. 391(1-2): 126-137 (2008) - [c37]Jeffrey O. Shallit:
The Frobenius Problem and Its Generalizations. Developments in Language Theory 2008: 72-83 - [c36]Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit:
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. Developments in Language Theory 2008: 339-358 - [c35]Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Finite Automata, Palindromes, Powers, and Patterns. LATA 2008: 52-63 - [c34]Jui-Yi Kao, Jeffrey O. Shallit, Zhi Xu:
The Frobenius Problem in a Free Monoid. STACS 2008: 421-432 - [i17]Zhi Xu, Jeffrey O. Shallit:
An NP-hardness Result on the Monoid Frobenius Problem. CoRR abs/0805.4049 (2008) - [i16]Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit:
Periodicity, repetitions, and orbits of an automatic sequence. CoRR abs/0808.1657 (2008) - [i15]Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu:
Decision Problems For Convex Languages. CoRR abs/0808.1928 (2008) - [i14]Jui-Yi Kao, Andrew J. Malton, Narad Rampersad, Jeffrey O. Shallit:
On NFAs Where All States are Final, Initial, or Both. CoRR abs/0808.2417 (2008) - [i13]Yann Bugeaud, Dalia Krieger, Jeffrey O. Shallit:
Morphic and Automatic Words: Maximal Blocks and Diophantine Approximation. CoRR abs/0808.2544 (2008) - [i12]Yu Hin Au, Aaron Robertson, Jeffrey O. Shallit:
Van der Waerden's Theorem and Avoidability in Words. CoRR abs/0812.2466 (2008) - [i11]Elyot Grant, Jeffrey O. Shallit, Thomas Stoll:
Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences. CoRR abs/0812.3186 (2008) - 2007
- [j65]Chiara Epifanio, Filippo Mignosi, Jeffrey O. Shallit, Ilaria Venturini:
On Sturmian graphs. Discret. Appl. Math. 155(8): 1014-1030 (2007) - [j64]Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit:
Enumeration of Context-Free Languages and Related Structures. J. Autom. Lang. Comb. 12(1-2): 79-95 (2007) - [j63]Dalia Krieger, Jeffrey O. Shallit:
Every real number greater than 1 is a critical exponent. Theor. Comput. Sci. 381(1-3): 177-182 (2007) - [c33]Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Avoiding Approximate Squares. Developments in Language Theory 2007: 278-289 - [c32]Margareta Ackerman, Jeffrey O. Shallit:
Efficient Enumeration of Regular Languages. CIAA 2007: 226-242 - [i10]Jui-Yi Kao, Jeffrey O. Shallit, Zhi Xu:
The Frobenius Problem in a Free Monoid. CoRR abs/0708.3224 (2007) - [i9]Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Finite automata, palindromes, patterns, and borders. CoRR abs/0711.3183 (2007) - [i8]Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit:
Finding the growth rate of a regular language in polynomial time. CoRR abs/0711.4990 (2007) - 2006
- [j62]James D. Currie, Narad Rampersad, Jeffrey O. Shallit:
Binary Words Containing Infinitely Many Overlaps. Electron. J. Comb. 13(1) (2006) - [j61]Shandy Brown, Narad Rampersad, Jeffrey O. Shallit, Troy Vasiga:
Squares and overlaps in the Thue-Morse sequence and some variants. RAIRO Theor. Informatics Appl. 40(3): 473-484 (2006) - [c31]Jeffrey O. Shallit:
New Directions in State Complexity. DCFS 2006: 41-45 - 2005
- [j60]Jean-Paul Allouche, Jeffrey O. Shallit, Guentcho Skordev:
Self-generating sets, integers with missing blocks, and substitutions. Discret. Math. 292(1-3): 1-15 (2005) - [j59]Bryan Krawetz, John Lawrence, Jeffrey O. Shallit:
State complexity and the monoid of transformations of a finite set. Int. J. Found. Comput. Sci. 16(3): 547-563 (2005) - [j58]Michael Domaratzki, Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang:
Non-uniqueness and radius of cyclic unary NFAs. Int. J. Found. Comput. Sci. 16(5): 883-896 (2005) - [j57]Keith Ellul, Bryan Krawetz, Jeffrey O. Shallit, Ming-wei Wang:
Regular Expressions: New Results and Open Problems. J. Autom. Lang. Comb. 10(4): 407-437 (2005) - [j56]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Avoiding large squares in infinite binary words. Theor. Comput. Sci. 339(1): 19-34 (2005) - [j55]Lucian Ilie, Pascal Ochem, Jeffrey O. Shallit:
A generalization of repetition threshold. Theor. Comput. Sci. 345(2-3): 359-369 (2005) - [c30]Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit:
Enumeration of Context-Free Languages and Related Structures. DCFS 2005: 85-96 - 2004
- [j54]Troy Vasiga, Jeffrey O. Shallit:
On the iteration of certain quadratic maps over GF(p). Discret. Math. 277(1-3): 219-240 (2004) - [j53]Jeffrey O. Shallit:
Simultaneous Avoidance Of Large Squares And Fractional Powers In Infinite Binary Words. Int. J. Found. Comput. Sci. 15(2): 317-327 (2004) - [j52]Keith Ellul, Bryan Krawetz, Jeffrey O. Shallit, Ming-wei Wang:
Regular Expressions: New Results and Open Problems. J. Autom. Lang. Comb. 9(2/3): 233-256 (2004) - [j51]Juhani Karhumäki, Jeffrey O. Shallit:
Polynomial versus exponential growth in repetition-free binary words. J. Comb. Theory A 105(2): 335-347 (2004) - [c29]Michael Domaratzki, Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang:
Non-Uniqueness and Radius of Cyclic Unary NFAs. DCFS 2004: 178-190 - [c28]Chiara Epifanio, Filippo Mignosi, Jeffrey O. Shallit, Ilaria Venturini:
Sturmian Graphs and a Conjecture of Moser. Developments in Language Theory 2004: 175-187 - [c27]Lucian Ilie, Pascal Ochem, Jeffrey O. Shallit:
A Generalization of Repetition Threshold. MFCS 2004: 818-826 - [c26]Jonathan Lee, Jeffrey O. Shallit:
Enumerating Regular Expressions and Their Languages. CIAA 2004: 2-22 - [c25]Bryan Krawetz, John Lawrence, Jeffrey O. Shallit:
State Complexity and the Monoid of Transformations of a Finite Set. CIAA 2004: 213-224 - 2003
- [b1]Jean-Paul Allouche, Jeffrey O. Shallit:
Automatic Sequences - Theory, Applications, Generalizations. Cambridge University Press 2003, ISBN 978-0-521-82332-6, pp. I-XVI, 1-571 - [j50]Sabin Cautis, Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang, Soroosh Yazdani:
Periodicity, morphisms, and matrices. Theor. Comput. Sci. 295: 107-121 (2003) - [j49]Jean-Paul Allouche, Jeffrey O. Shallit:
The ring of k-regular sequences, II. Theor. Comput. Sci. 307(1): 3-29 (2003) - [i7]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Cubefree binary words avoiding long squares. CoRR math.CO/0302303 (2003) - [i6]Juhani Karhumäki, Jeffrey O. Shallit:
Polynomial versus Exponential Growth in Repetition-Free Binary Words. CoRR math.CO/0304095 (2003) - [i5]Jeffrey O. Shallit:
Simultaneous avoidance of large squares and fractional powers in infinite binary words. CoRR math.CO/0304476 (2003) - [i4]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Avoiding large squares in infinite binary words. CoRR math.CO/0306081 (2003) - [i3]Lucian Ilie, Jeffrey O. Shallit:
A Generalization of Repetition Threshold. CoRR math.CO/0310144 (2003) - 2002
- [j48]John A. Ellis, Hongbing Fan, Jeffrey O. Shallit:
The Cycles of the Multiway Perfect Shuffle Permutation. Discret. Math. Theor. Comput. Sci. 5(1): 169-180 (2002) - [j47]Giovanni Pighizzini, Jeffrey O. Shallit:
Unary Language Operations, State Complexity and Jacobsthal's Function. Int. J. Found. Comput. Sci. 13(1): 145-159 (2002) - [j46]Michael Domaratzki, Giovanni Pighizzini, Jeffrey O. Shallit:
Simulating finite automata with context-free grammars. Inf. Process. Lett. 84(6): 339-344 (2002) - [j45]Michael Domaratzki, Derek Kisman, Jeffrey O. Shallit:
On the Number of Distinct Languages Accepted by Finite Automata with n States. J. Autom. Lang. Comb. 7(4): 469-486 (2002) - [j44]Giovanni Pighizzini, Jeffrey O. Shallit, Ming-wei Wang:
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. J. Comput. Syst. Sci. 65(2): 393-414 (2002) - [j43]Jeffrey O. Shallit:
The computational complexity of the local postage stamp problem. SIGACT News 33(1): 90-94 (2002) - [j42]Jeffrey O. Shallit, Ming-wei Wang:
On two-sided infinite fixed points of morphisms. Theor. Comput. Sci. 270(1-2): 659-675 (2002) - [c24]Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang:
Regular Expressions: New Results and Open Problems. DCFS 2002: 17-34 - 2001
- [j41]Jeffrey O. Shallit, Ming-wei Wang:
Weakly Self-Avoiding Words and a Construction of Friedman. Electron. J. Comb. 8(1) (2001) - [j40]Jeffrey O. Shallit, Ming-wei Wang:
Automatic Complexity of Strings. J. Autom. Lang. Comb. 6(4): 537-554 (2001) - [c23]Michael Domaratzki, Derek Kisman, Jeffrey O. Shallit:
On the Number of Distinct Languages Accepted by Finite Automata with n States. DCFS 2001: 67-78 - [c22]Michael Domaratzki, Jeffrey O. Shallit, Sheng Yu:
Minimal Covers of Formal Languages. Developments in Language Theory 2001: 319-329 - [c21]Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang:
Variations on a Theorem of Fine & Wilf. MFCS 2001: 512-523 - [i2]Jeffrey O. Shallit:
The computational complexity of the local postage stamp problem. CoRR math.NT/0112257 (2001) - 2000
- [j39]Jean-Paul Allouche, Jeffrey O. Shallit:
Sums of Digits, Overlaps, and Palindromes. Discret. Math. Theor. Comput. Sci. 4(1): 1-10 (2000) - [j38]Jeffrey O. Shallit:
Automaticity and Rationality. J. Autom. Lang. Comb. 5(3): 255-268 (2000) - [j37]Mihály Bencze, Dan Saracino, Allen Stenger, S. Amghibech, Jean Anglesio, R. Bauer, A. Siegel, David M. Bloom, G. L. Body, David Callan, Robin J. Chapman, Kevin Ford, Stephen M. Gagola Jr., N. Gauthier, W. V. Grounds, T. Hagedorn, R. T. Koether, N. Komanda, R. N. Krishnan, K.-W. Lau, John H. Lindsey II, L. E. Mattics, C. A. Minh, H. N. Ozsoylev, C. Y. Yildirim, P. G. Poonacha, N. R. Sanjeev, C. Popescu, J. Robertson, H.-J. Sieffert, Jeffrey O. Shallit, N. C. Singer, Albert Stadler, D. C. Terr, T. V. Triff, T. Trimble, Pavel Trojovský:
A Recurrence Generating Multiples of Primes: 10655. Am. Math. Mon. 107(3): 281-282 (2000) - [c20]Jeffrey O. Shallit:
Formal languages and number theory. Unusual Applications of Number Theory 2000: 169-181 - [c19]Jeffrey O. Shallit:
State Complexity and Jacobsthal's Function. CIAA 2000: 272-278
1990 – 1999
- 1999
- [j36]James D. Currie, Holger Petersen, John Michael Robson, Jeffrey O. Shallit:
Separating Words with Small Grammars. J. Autom. Lang. Comb. 4(2): 101-110 (1999) - [j35]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
The Computational Complexity of Some Problems of Linear Algebra. J. Comput. Syst. Sci. 58(3): 572-596 (1999) - [c18]John Loftus, Jeffrey O. Shallit, Ming-wei Wang:
New problems of pattern avoidance. Developments in Language Theory 1999: 185-199 - [c17]Jeffrey O. Shallit, Ming-wei Wang:
On Two-Sided Infinite Fixed Points of Morphisms. FCT 1999: 488-499 - [c16]Jeffrey O. Shallit, David Swart:
An Efficient Algorithm for Computing the ith letter of 4na. SODA 1999: 768-775 - [r1]Jon Grantham, Carl Pomerance, Bart Goddard, Jeffrey O. Shallit:
Number Theory. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [j34]Ian Glaister, Jeffrey O. Shallit:
Automaticity III: Polynomial Automaticity and Context-Free Languages. Comput. Complex. 7(4): 371-387 (1998) - [j33]Jean-Paul Allouche, James D. Currie, Jeffrey O. Shallit:
Extremal Infinite Overlap-Free Binary Words. Electron. J. Comb. 5 (1998) - [j32]Ming-wei Wang, Jeffrey O. Shallit:
On Minimal Words With Given Subword Complexity. Electron. J. Comb. 5 (1998) - [j31]Jean-Paul Allouche, Jeffrey O. Shallit:
Generalized Perturbed Symmetry. Eur. J. Comb. 19(4): 401-411 (1998) - [c15]Jean-Paul Allouche, Jeffrey O. Shallit:
The Ubiquitous Prouhet-Thue-Morse Sequence. SETA 1998: 1-16 - 1997
- [j30]Jean-Paul Allouche, Emmanuel Cateland, William J. Gilbert, Heinz-Otto Peitgen, Jeffrey O. Shallit, Guentcho Skordev:
Automatic Maps in Exotic Numeration System. Theory Comput. Syst. 30(3): 285-331 (1997) - [j29]Carl Pomerance, John Michael Robson, Jeffrey O. Shallit:
Automaticity II: Descriptional Complexity in the Unary Case. Theor. Comput. Sci. 180(1-2): 181-201 (1997) - [j28]Jeffrey O. Shallit, Harriet Lyons:
Social Issues in Canada's Information Society. Inf. Soc. 13(2): 147-151 (1997) - [c14]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). STACS 1997: 451-462 - [i1]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
The Computational Complexity of Some Problems of Linear Algebra. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j27]Ian Glaister, Jeffrey O. Shallit:
A Lower Bound Technique for the Size of Nondeterministic Finite Automata. Inf. Process. Lett. 59(2): 75-77 (1996) - [j26]Jeffrey O. Shallit, Yuri Breitbart:
Automaticity I: Properties of a Measure of Descriptional Complexity. J. Comput. Syst. Sci. 53(1): 10-25 (1996) - [j25]Eric Bach, Richard F. Lukes, Jeffrey O. Shallit, Hugh C. Williams:
Results and estimates on pseudopowers. Math. Comput. 65(216): 1737-1747 (1996) - [j24]Siegfried Lehr, Jeffrey O. Shallit, John Tromp:
On the Vector Space of the Automatic Reals. Theor. Comput. Sci. 163(1&2): 193-210 (1996) - [c13]Ian Glaister, Jeffrey O. Shallit:
Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract). MFCS 1996: 382-393 - 1995
- [j23]John Tromp, Jeffrey O. Shallit:
Subword Complexity of a Generalized Thue-Morse Word. Inf. Process. Lett. 54(6): 313-316 (1995) - 1994
- [j22]Per Enflo, Andrew Granville, Jeffrey O. Shallit, Sheng Yu:
on Sparse Languages L such that LL = Sigma. Discret. Appl. Math. 52(3): 275-285 (1994) - [j21]Jeffrey O. Shallit:
Numeration Systems, Linear Recurrences, and Regular Sets. Inf. Comput. 113(2): 331-347 (1994) - [j20]Jeffrey O. Shallit, Jonathan P. Sorenson:
Analysis of a Left-Shift Binary GCD Algorithm. J. Symb. Comput. 17(6): 473-486 (1994) - [j19]Jeffrey O. Shallit:
A Minimization Problem. SIAM Rev. 36(3): 490-491 (1994) - [c12]Jeffrey O. Shallit, Jonathan P. Sorenson:
Analysis of a left-shift binary GCD algorithm. ANTS 1994: 169-183 - [c11]Jeffrey O. Shallit, Yuri Breitbart:
Automaticity: Properties of a Measure of Descriptional Complexity. STACS 1994: 619-630 - 1993
- [j18]Jeffrey O. Shallit, Jonathan Sorenson:
A binary algorithm for the Jacobi symbol. SIGSAM Bull. 27(1): 4-11 (1993) - [j17]Jeffrey O. Shallit:
On the maximum number of distinct factors of a binary string. Graphs Comb. 9(2-4): 197-200 (1993) - [j16]Eric Bach, James R. Driscoll, Jeffrey O. Shallit:
Factor Refinement. J. Algorithms 15(2): 199-222 (1993) - 1992
- [j15]Jeffrey O. Shallit, David A. Wilson:
The "3x + 1" Problem and Finite Automata. Bull. EATCS 46: 182-185 (1992) - [j14]Jeffrey O. Shallit:
Randomized algorithms in "primitive" cultures or what is the oracle complexity of a dead chicken? SIGACT News 23(4): 77-80 (1992) - [j13]Jean-Paul Allouche, Patrick Morton, Jeffrey O. Shallit:
Pattern Spectra, Substring Enumeration, and Automatic Sequences. Theor. Comput. Sci. 94(2): 161-174 (1992) - [j12]Jean-Paul Allouche, Jeffrey O. Shallit:
The Ring of k-Regular Sequences. Theor. Comput. Sci. 98(2): 163-197 (1992) - [c10]Jeffrey O. Shallit:
Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract). ICALP 1992: 89-100 - [c9]Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey O. Shallit:
Characterizing Regular Languages with Polynomial Densities. MFCS 1992: 494-503 - 1990
- [j11]Jeffrey O. Shallit:
On the Worst Case of Three Algorithms for Computing the Jacobi Symbol. J. Symb. Comput. 10(6): 593-610 (1990) - [c8]Eric Bach, James R. Driscoll, Jeffrey O. Shallit:
Factor Refinement. SODA 1990: 201-211 - [c7]Jean-Paul Allouche, Jeffrey O. Shallit:
The Ring of k-Regular Sequences. STACS 1990: 12-23
1980 – 1989
- 1989
- [j10]Jeffrey O. Shallit, Jorge Stolfi:
Two methods for generating fractals. Comput. Graph. 13(2): 185-191 (1989) - [j9]Jean-Paul Allouche, J. Bétréma, Jeffrey O. Shallit:
Sur Des Points Fixes De Morphismes D'Un Monoïde Libre. RAIRO Theor. Informatics Appl. 23(3): 235-249 (1989) - [j8]Michel Mendès France, Jeffrey O. Shallit:
Wire bending. J. Comb. Theory A 50(1): 1-23 (1989) - [j7]Jean-Paul Allouche, Péter Hajnal, Jeffrey O. Shallit:
Analysis of an Infinite Product Algorithm. SIAM J. Discret. Math. 2(1): 1-15 (1989) - [c6]Jeffrey O. Shallit:
A Generalization of Automatic Sequences. STACS 1989: 156-167 - 1988
- [j6]David Rubinstein, Jeffrey O. Shallit, Mario Szegedy:
A Subset Coloring Algorithm and Its Applications to Computer Graphics. Commun. ACM 31(10): 1228-1232 (1988) - [j5]Jeffrey O. Shallit:
Fractals, bitmaps, and APL. ACM SIGAPL APL Quote Quad 18(3): 24-32 (1988) - [j4]Jeffrey O. Shallit:
A Generalization of Automatic Sequences. Theor. Comput. Sci. 61: 1-16 (1988) - 1986
- [j3]Eric Bach, Gary L. Miller, Jeffrey O. Shallit:
Sums of Divisors, Perfect Numbers and Factoring. SIAM J. Comput. 15(4): 1143-1154 (1986) - 1985
- [j2]Jeffrey O. Shallit, Adi Shamir:
Number-Theoretic Functions Which Are Equivalent to Number of Divisors. Inf. Process. Lett. 20(3): 151-153 (1985) - [c5]Eric Bach, Jeffrey O. Shallit:
Factoring with Cyclotomic Polynomials. FOCS 1985: 443-450 - 1984
- [c4]Eric Bach, Gary L. Miller, Jeffrey O. Shallit:
Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract). STOC 1984: 183-190 - 1983
- [c3]Jeffrey O. Shallit:
Merrily we roll along: Some aspects of? APL 1983: 243-249 - 1982
- [c2]Jeffrey O. Shallit:
Computational simplicial homology in APL. APL 1982: 332-338 - 1981
- [c1]Jeffrey O. Shallit:
Infinite arrays and diagonalization. APL 1981: 281-285
1970 – 1979
- 1976
- [j1]Jeffrey O. Shallit:
The prime factorization of 1. ACM SIGAPL APL Quote Quad 6(4): 36-37 (1976)
Coauthor Index
[j162] [j158] [i149] [j155] [j152] [c88] [c87] [i142] [i140] [j150] [i125] [i121] [i120] [j140] [i111] [i110] [j132] [c77] [i102] [i100] [j122] [j118] [c73] [i90] [i82] [i79] [i74] [c65] [i69] [j92] [j91] [j90] [j81] [c45] [c42] [i35] [i28] [j79] [j78] [i25] [j73] [j72] [j71] [j70] [j68] [i21] [i20] [i18] [j67] [j66] [c36] [c35] [i16] [i14] [c33] [i9] [i8] [j62] [j61] [j56] [i7] [i4]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-02 19:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
