The prime factorization of 1. - Jeffrey O. Shallit (ACM SIGAPL APL Quote Quad, 1976)

Infinite arrays and diagonalization. - Jeffrey O. Shallit (APL, 1981)

Computational simplicial homology in APL. - Jeffrey O. Shallit (APL, 1982)

Merrily we roll along: Some aspects of? - Jeffrey O. Shallit (APL, 1983)

Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) - Eric Bach 001; Gary L. Miller; Jeffrey O. Shallit (STOC, 1984)

Factoring with Cyclotomic Polynomials - Eric Bach 001; Jeffrey O. Shallit (FOCS, 1985)

Number-Theoretic Functions Which Are Equivalent to Number of Divisors. - Jeffrey O. Shallit; Adi Shamir (Inf. Process. Lett., 1985)

Sums of Divisors, Perfect Numbers and Factoring. - Eric Bach 001; Gary L. Miller; Jeffrey O. Shallit (SIAM J. Comput., 1986)

A Subset Coloring Algorithm and Its Applications to Computer Graphics. - David Rubinstein; Jeffrey O. Shallit; Mario Szegedy (Commun. ACM, 1988)

Fractals, bitmaps, and APL. - Jeffrey O. Shallit (ACM SIGAPL APL Quote Quad, 1988)

A Generalization of Automatic Sequences. - Jeffrey O. Shallit (Theor. Comput. Sci., 1988)

Two methods for generating fractals. - Jeffrey O. Shallit; Jorge Stolfi (Comput. Graph., 1989)

Sur Des Points Fixes De Morphismes D'Un Monoïde Libre. - Jean-Paul Allouche; J. Bétréma; Jeffrey O. Shallit (RAIRO Theor. Informatics Appl., 1989)

Wire bending. - Michel Mendès France; Jeffrey O. Shallit (J. Comb. Theory A, 1989)

Analysis of an Infinite Product Algorithm. - Jean-Paul Allouche; Péter Hajnal; Jeffrey O. Shallit (SIAM J. Discret. Math., 1989)

On the Worst Case of Three Algorithms for Computing the Jacobi Symbol. - Jeffrey O. Shallit (J. Symb. Comput., 1990)

Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract). - Jeffrey O. Shallit (ICALP, 1992)

Characterizing Regular Languages with Polynomial Densities. - Andrew Szilard; Sheng Yu 001; Kaizhong Zhang; Jeffrey O. Shallit (MFCS, 1992)

The "3x + 1" Problem and Finite Automata. - Jeffrey O. Shallit; David A. Wilson (Bull. EATCS, 1992)

Randomized algorithms in "primitive" cultures or what is the oracle complexity of a dead chicken? - Jeffrey O. Shallit (SIGACT News, 1992)

Pattern Spectra, Substring Enumeration, and Automatic Sequences. - Jean-Paul Allouche; Patrick Morton; Jeffrey O. Shallit (Theor. Comput. Sci., 1992)

The Ring of k-Regular Sequences. - Jean-Paul Allouche; Jeffrey O. Shallit (Theor. Comput. Sci., 1992)

A binary algorithm for the Jacobi symbol. - Jeffrey O. Shallit; Jonathan Sorenson (SIGSAM Bull., 1993)

On the maximum number of distinct factors of a binary string. - Jeffrey O. Shallit (Graphs Comb., 1993)

Factor Refinement. - Eric Bach 001; James R. Driscoll; Jeffrey O. Shallit (J. Algorithms, 1993)

Automaticity: Properties of a Measure of Descriptional Complexity. - Jeffrey O. Shallit; Yuri Breitbart (STACS, 1994)

on Sparse Languages L such that LL = Sigma. - Per Enflo; Andrew Granville; Jeffrey O. Shallit; Sheng Yu 001 (Discret. Appl. Math., 1994)

Analysis of a Left-Shift Binary GCD Algorithm. - Jeffrey O. Shallit; Jonathan P. Sorenson (J. Symb. Comput., 1994)

A Minimization Problem. - Jeffrey O. Shallit (SIAM Rev., 1994)

Numeration Systems, Linear Recurrences, and Regular Sets - Jeffrey O. Shallit (Inf. Comput., 1994)

Subword Complexity of a Generalized Thue-Morse Word. - John Tromp; Jeffrey O. Shallit (Inf. Process. Lett., 1995)

Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract). - Ian Glaister; Jeffrey O. Shallit (MFCS, 1996)

A Lower Bound Technique for the Size of Nondeterministic Finite Automata. - Ian Glaister; Jeffrey O. Shallit (Inf. Process. Lett., 1996)

Automaticity I: Properties of a Measure of Descriptional Complexity. - Jeffrey O. Shallit; Yuri Breitbart (J. Comput. Syst. Sci., 1996)

Results and estimates on pseudopowers. - Eric Bach 001; Richard F. Lukes; Jeffrey O. Shallit; Hugh C. Williams (Math. Comput., 1996)

On the Vector Space of the Automatic Reals. - Siegfried Lehr; Jeffrey O. Shallit; John Tromp (Theor. Comput. Sci., 1996)

The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). - Jonathan F. Buss; Gudmund Skovbjerg Frandsen; Jeffrey O. Shallit (STACS, 1997)

Automatic Maps in Exotic Numeration System. - Jean-Paul Allouche; Emmanuel Cateland; William J. Gilbert; Heinz-Otto Peitgen; Jeffrey O. Shallit; Guentcho Skordev (Theory Comput. Syst., 1997)

Automaticity II: Descriptional Complexity in the Unary Case. - Carl Pomerance; John Michael Robson; Jeffrey O. Shallit (Theor. Comput. Sci., 1997)

Social Issues in Canada's Information Society. - Jeffrey O. Shallit; Harriet Lyons (Inf. Soc., 1997)

The Ubiquitous Prouhet-Thue-Morse Sequence. - Jean-Paul Allouche; Jeffrey O. Shallit (SETA, 1998)

Automaticity III: Polynomial Automaticity and Context-Free Languages. - Ian Glaister; Jeffrey O. Shallit (Comput. Complex., 1998)

Extremal Infinite Overlap-Free Binary Words. - Jean-Paul Allouche; James D. Currie; Jeffrey O. Shallit (Electron. J. Comb., 1998)

On Minimal Words With Given Subword Complexity. - Ming-wei Wang; Jeffrey O. Shallit (Electron. J. Comb., 1998)

Generalized Perturbed Symmetry. - Jean-Paul Allouche; Jeffrey O. Shallit (Eur. J. Comb., 1998)

New problems of pattern avoidance. - John Loftus; Jeffrey O. Shallit; Ming-wei Wang (Developments in Language Theory, 1999)

An Efficient Algorithm for Computing the ith letter of 4na. - Jeffrey O. Shallit; David Swart (SODA, 1999)

Separating Words with Small Grammars. - James D. Currie; Holger Petersen 001; John Michael Robson; Jeffrey O. Shallit (J. Autom. Lang. Comb., 1999)

The Computational Complexity of Some Problems of Linear Algebra. - Jonathan F. Buss; Gudmund Skovbjerg Frandsen; Jeffrey O. Shallit (J. Comput. Syst. Sci., 1999)

Number Theory. - Jon Grantham; Carl Pomerance; Bart Goddard; Jeffrey O. Shallit (Handbook of Discrete and Combinatorial Mathematics, 1999)

Formal languages and number theory. - Jeffrey O. Shallit (Unusual Applications of Number Theory, 2000)

State Complexity and Jacobsthal's Function. - Jeffrey O. Shallit (CIAA, 2000)

Sums of Digits, Overlaps, and Palindromes. - Jean-Paul Allouche; Jeffrey O. Shallit (Discret. Math. Theor. Comput. Sci., 2000)

Automaticity and Rationality. - Jeffrey O. Shallit (J. Autom. Lang. Comb., 2000)

A Recurrence Generating Multiples of Primes: 10655. - 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; et al. (Am. Math. Mon., 2000)

Minimal Covers of Formal Languages. - Michael Domaratzki; Jeffrey O. Shallit; Sheng Yu 001 (Developments in Language Theory, 2001)

Variations on a Theorem of Fine & Wilf. - Filippo Mignosi; Jeffrey O. Shallit; Ming-wei Wang (MFCS, 2001)

Weakly Self-Avoiding Words and a Construction of Friedman. - Jeffrey O. Shallit; Ming-wei Wang (Electron. J. Comb., 2001)

Automatic Complexity of Strings. - Jeffrey O. Shallit; Ming-wei Wang (J. Autom. Lang. Comb., 2001)

Regular Expressions: New Results and Open Problems. - Keith Ellul; Jeffrey O. Shallit; Ming-wei Wang (DCFS, 2002)

The Cycles of the Multiway Perfect Shuffle Permutation. - John A. Ellis; Hongbing Fan; Jeffrey O. Shallit (Discret. Math. Theor. Comput. Sci., 2002)

Unary Language Operations, State Complexity and Jacobsthal's Function. - Giovanni Pighizzini; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2002)

Simulating finite automata with context-free grammars. - Michael Domaratzki; Giovanni Pighizzini; Jeffrey O. Shallit (Inf. Process. Lett., 2002)

On the Number of Distinct Languages Accepted by Finite Automata with n States. - Michael Domaratzki; Derek Kisman; Jeffrey O. Shallit (J. Autom. Lang. Comb., 2002)

Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. - Giovanni Pighizzini; Jeffrey O. Shallit; Ming-wei Wang (J. Comput. Syst. Sci., 2002)

The computational complexity of the local postage stamp problem. - Jeffrey O. Shallit (SIGACT News, 2002)

On two-sided infinite fixed points of morphisms. - Jeffrey O. Shallit; Ming-wei Wang (Theor. Comput. Sci., 2002)

Automatic Sequences - Theory, Applications, Generalizations. - Jean-Paul Allouche; Jeffrey O. Shallit (Cambridge University Press, 2003)

Cubefree binary words avoiding long squares - Narad Rampersad; Jeffrey O. Shallit; Ming-wei Wang (CoRR, 2003)

A Generalization of Repetition Threshold - Lucian Ilie; Jeffrey O. Shallit (CoRR, 2003)

The ring of k-regular sequences, II. - Jean-Paul Allouche; Jeffrey O. Shallit (Theor. Comput. Sci., 2003)

Periodicity, morphisms, and matrices. - Sabin Cautis; Filippo Mignosi; Jeffrey O. Shallit; Ming-wei Wang; Soroosh Yazdani (Theor. Comput. Sci., 2003)

Sturmian Graphs and a Conjecture of Moser. - Chiara Epifanio; Filippo Mignosi; Jeffrey O. Shallit; Ilaria Venturini (Developments in Language Theory, 2004)

Enumerating Regular Expressions and Their Languages. - Jonathan Lee 005; Jeffrey O. Shallit (CIAA, 2004)

On the iteration of certain quadratic maps over GF(p). - Troy Vasiga; Jeffrey O. Shallit (Discret. Math., 2004)

Simultaneous Avoidance Of Large Squares And Fractional Powers In Infinite Binary Words. - Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2004)

Polynomial versus exponential growth in repetition-free binary words. - Juhani Karhumäki; Jeffrey O. Shallit (J. Comb. Theory A, 2004)

Self-generating sets, integers with missing blocks, and substitutions. - Jean-Paul Allouche; Jeffrey O. Shallit; Guentcho Skordev (Discret. Math., 2005)

Non-uniqueness and radius of cyclic unary NFAs. - Michael Domaratzki; Keith Ellul; Jeffrey O. Shallit; Ming-wei Wang (Int. J. Found. Comput. Sci., 2005)

State complexity and the monoid of transformations of a finite set. - Bryan Krawetz; John Lawrence; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2005)

Regular Expressions: New Results and Open Problems. - Keith Ellul; Bryan Krawetz; Jeffrey O. Shallit; Ming-wei Wang (J. Autom. Lang. Comb., 2005)

A generalization of repetition threshold. - Lucian Ilie; Pascal Ochem; Jeffrey O. Shallit (Theor. Comput. Sci., 2005)

Avoiding large squares in infinite binary words. - Narad Rampersad; Jeffrey O. Shallit; Ming-wei Wang (Theor. Comput. Sci., 2005)

New Directions in State Complexity. - Jeffrey O. Shallit (DCFS, 2006)

Binary Words Containing Infinitely Many Overlaps. - James D. Currie; Narad Rampersad; Jeffrey O. Shallit (Electron. J. Comb., 2006)

Squares and overlaps in the Thue-Morse sequence and some variants. - Shandy Brown; Narad Rampersad; Jeffrey O. Shallit; Troy Vasiga (RAIRO Theor. Informatics Appl., 2006)

Avoiding Approximate Squares. - Dalia Krieger; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (Developments in Language Theory, 2007)

Efficient Enumeration of Regular Languages. - Margareta Ackerman; Jeffrey O. Shallit (CIAA, 2007)

Finite automata, palindromes, patterns, and borders - Terry Anderson; Narad Rampersad; Nicolae Santean; Jeffrey O. Shallit (CoRR, 2007)

Finding the growth rate of a regular language in polynomial time - Dalia Krieger; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2007)

On Sturmian graphs. - Chiara Epifanio; Filippo Mignosi; Jeffrey O. Shallit; Ilaria Venturini (Discret. Appl. Math., 2007)

Enumeration of Context-Free Languages and Related Structures. - Michael Domaratzki; Alexander Okhotin; Jeffrey O. Shallit (J. Autom. Lang. Comb., 2007)

Every real number greater than 1 is a critical exponent. - Dalia Krieger; Jeffrey O. Shallit (Theor. Comput. Sci., 2007)

A Second Course in Formal Languages and Automata Theory. - Jeffrey O. Shallit (Cambridge University Press, 2008)

Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. - Pawel Gawrychowski; Dalia Krieger; Narad Rampersad; Jeffrey O. Shallit (Developments in Language Theory, 2008)

The Frobenius Problem and Its Generalizations. - Jeffrey O. Shallit (Developments in Language Theory, 2008)

Finite Automata, Palindromes, Powers, and Patterns. - Terry Anderson; Narad Rampersad; Nicolae Santean; Jeffrey O. Shallit (LATA, 2008)

The Frobenius Problem in a Free Monoid. - Jui-Yi Kao; Jeffrey O. Shallit; Zhi Xu 002 (STACS, 2008)

Morphic and Automatic Words: Maximal Blocks and Diophantine Approximation. - Yann Bugeaud; Dalia Krieger; Jeffrey O. Shallit (CoRR, 2008)

Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences. - Elyot Grant; Jeffrey O. Shallit; Thomas Stoll (CoRR, 2008)

An NP-hardness Result on the Monoid Frobenius Problem - Zhi Xu 002; Jeffrey O. Shallit (CoRR, 2008)

On NFAs Where All States are Final, Initial, or Both - Jui-Yi Kao; Andrew J. Malton; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2008)

Avoiding Approximate Squares. - Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2008)

Words avoiding repetitions in arithmetic progressions. - Jui-Yi Kao; Narad Rampersad; Jeffrey O. Shallit; Manuel Silva 003 (Theor. Comput. Sci., 2008)

Counting Abelian Squares. - L. Bruce Richmond; Jeffrey O. Shallit (Electron. J. Comb., 2009)

Closures in Formal Languages: Concatenation, Separation, and Algorithms - Janusz A. Brzozowski; Elyot Grant; Jeffrey O. Shallit (CoRR, 2009)

Length of the Shortest Word in the Intersection of Regular Languages - Thomas Ang; Jeffrey O. Shallit (CoRR, 2009)

Automata and Reduced Words in the Free Group - Thomas Ang; Giovanni Pighizzini; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2009)

Avoiding squares and overlaps over the natural numbers. - Mathieu Guay-Paquet; Jeffrey O. Shallit (Discret. Math., 2009)

Hamming distance for conjugates. - Jeffrey O. Shallit (Discret. Math., 2009)

Detecting palindromes, patterns and borders in regular languages. - Terry Anderson; John Loftus; Narad Rampersad; Nicolae Santean; Jeffrey O. Shallit (Inf. Comput., 2009)

Efficient enumeration of words in regular languages. - Margareta Ackerman; Jeffrey O. Shallit (Theor. Comput. Sci., 2009)

Periodicity, repetitions, and orbits of an automatic sequence. - Jean-Paul Allouche; Narad Rampersad; Jeffrey O. Shallit (Theor. Comput. Sci., 2009)

On NFAs where all states are final, initial, or both. - Jui-Yi Kao; Narad Rampersad; Jeffrey O. Shallit (Theor. Comput. Sci., 2009)

Decimations of languages and state complexity. - Dalia Krieger; Avery Miller; Narad Rampersad; Bala Ravikumar; Jeffrey O. Shallit (Theor. Comput. Sci., 2009)

State complexity of unique rational operations. - Narad Rampersad; Nicolae Santean; Jeffrey O. Shallit; Bala Ravikumar (Theor. Comput. Sci., 2009)

On Lazy Representations and Sturmian Graphs. - Chiara Epifanio; Christiane Frougny; Alessandra Gabriele; Filippo Mignosi; Jeffrey O. Shallit (CIAA, 2010)

Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time. - Pawel Gawrychowski; Dalia Krieger; Narad Rampersad; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2010)

Detecting patterns in finite regular and context-free languages. - Narad Rampersad; Jeffrey O. Shallit (Inf. Process. Lett., 2010)

Cryptographic applications of analytic number theory: lower bounds and pseudorandomness author of book: Igor Shparlinski Birkäuser, 2003. - Jeffrey O. Shallit (SIGACT News, 2010)

Decidability and Shortest Strings in Formal Languages. - Levent Alpoge; Thomas Ang; Luke Schaeffer; Jeffrey O. Shallit (DCFS, 2011)

Remarks on Separating Words. - Erik D. Demaine; Sarah Eisenstat; Jeffrey O. Shallit; David A. Wilson (DCFS, 2011)

Fife's Theorem Revisited. - Jeffrey O. Shallit (Developments in Language Theory, 2011)

Finite Orbits of Language Operations. - Emilie Charlier; Michael Domaratzki; Tero Harju; Jeffrey O. Shallit (LATA, 2011)

A variant of Hofstadter's sequence and finite automata - Jean-Paul Allouche; Jeffrey O. Shallit (CoRR, 2011)

The Critical Exponent is Computable for Automatic Sequences - Jeffrey O. Shallit (WORDS, 2011)

Fife's Theorem for (7/3)-Powers - Narad Rampersad; Jeffrey O. Shallit; Arseny M. Shur (WORDS, 2011)

Shuffling and Unshuffling - Narad Rampersad; Jeffrey O. Shallit (CoRR, 2011)

A pattern sequence approach to Stern's sequence. - Michael Coons; Jeffrey O. Shallit (Discret. Math., 2011)

Decision problems for convex languages. - Janusz A. Brzozowski; Jeffrey O. Shallit; Zhi Xu 002 (Inf. Comput., 2011)

Closures in Formal Languages and Kuratowski's Theorem. - Janusz A. Brzozowski; Elyot Grant; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2011)

Van der Waerden's Theorem and Avoidability in Words. - Yu Hin Au; Aaron Robertson; Jeffrey O. Shallit (Integers, 2011)

Unbounded Discrepancy in Frobenius Numbers. - Jeffrey O. Shallit; James Stankewicz (Integers, 2011)

Inverse star, borders, and palstars. - Narad Rampersad; Jeffrey O. Shallit; Ming-wei Wang (Inf. Process. Lett., 2011)

Information theory, evolutionary computation, and Dembski's "complex specified information". - Wesley R. Elsberry; Jeffrey O. Shallit (Synth., 2011)

The State Complexity of Star-Complement-Star. - Galina Jirásková; Jeffrey O. Shallit (Developments in Language Theory, 2012)

k-Automatic Sets of Rational Numbers. - Eric Rowland; Jeffrey O. Shallit (LATA, 2012)

Automatic Theorem-Proving in Combinatorics on Words - Dane Henshall; Jeffrey O. Shallit (CoRR, 2012)

Enumerating regular expressions and their languages - Hermann Gruber; Jonathan Lee 005; Jeffrey O. Shallit (CoRR, 2012)

The Subword Complexity of k-Automatic Sequences is k-Synchronized - Daniel Goc; Luke Schaeffer; Jeffrey O. Shallit (CoRR, 2012)

Primitive Words and Lyndon Words in Automatic Sequences - Daniel Goc; Jeffrey O. Shallit (CoRR, 2012)

Least periods of k-automatic sequences - Daniel Goc; Jeffrey O. Shallit (CoRR, 2012)

Sturmian graphs and integer representations over numeration systems. - Chiara Epifanio; Christiane Frougny; Alessandra Gabriele; Filippo Mignosi; Jeffrey O. Shallit (Discret. Appl. Math., 2012)

Avoiding 3/2-powers over the natural numbers. - Eric Rowland; Jeffrey O. Shallit (Discret. Math., 2012)

Shuffling and Unshuffling. - Dane Henshall; Narad Rampersad; Jeffrey O. Shallit (Bull. EATCS, 2012)

The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages. - Narad Rampersad; Jeffrey O. Shallit; Zhi Xu 002 (Fundam. Informaticae, 2012)

Enumeration and Decidable Properties of Automatic Sequences. - Emilie Charlier; Narad Rampersad; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2012)

The Critical Exponent is Computable for Automatic Sequences. - Luke Schaeffer; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2012)

Review of finite fields and applications by Gary L. Mullen and Carl Mummert. - Jeffrey O. Shallit (SIGACT News, 2012)

Review of biscuits of number theory by Arthur T. Benjamin and Ezra Brown. - Jeffrey O. Shallit (SIGACT News, 2012)

Description of Generalized Continued Fractions by Finite Automata. - Jeffrey O. Shallit (Number Theory and Related Fields, 2013)

Decidability and Enumeration for Automatic Sequences: A Survey. - Jeffrey O. Shallit (CSR, 2013)

Sets Represented as the Length-n Factors of a Word. - Shuo Tan; Jeffrey O. Shallit (WORDS, 2013)

Shortest Repetition-Free Words Accepted by Automata. - Hamoon Mousavi; Jeffrey O. Shallit (DCFS, 2013)

Subword Complexity and k-Synchronization. - Daniel Goc; Luke Schaeffer; Jeffrey O. Shallit (Developments in Language Theory, 2013)

Repetition Avoidance in Circular Factors. - Hamoon Mousavi; Jeffrey O. Shallit (Developments in Language Theory, 2013)

On the Number of Unbordered Factors. - Daniel Goc; Hamoon Mousavi; Jeffrey O. Shallit (LATA, 2013)

Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences. - Daniel Goc; Kalle Saari; Jeffrey O. Shallit (LATA, 2013)

Remarks on Privileged Words. - Michael Forsyth; Amlesh Jayakumar; Jeffrey O. Shallit (CoRR, 2013)

Counting Palstars. - Jeffrey O. Shallit (CoRR, 2013)

Counting Sequences with Small Discrepancies. - Alexander Leong; Jeffrey O. Shallit (Exp. Math., 2013)

Filtrations of Formal Languages by Arithmetic Progressions. - Hamoon Mousavi; Jeffrey O. Shallit (Fundam. Informaticae, 2013)

Composition and orbits of language operations: finiteness and upper bounds. - Emilie Charlier; Michael Domaratzki; Tero Harju; Jeffrey O. Shallit (Int. J. Comput. Math., 2013)

Automatic Theorem-Proving in Combinatorics on Words. - Daniel Goc; Dane Henshall; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2013)

Review of computability and complexity theory by Steven Homer and Alan L. Selman. - Jeffrey O. Shallit (SIGACT News, 2013)

Counting the Palstars. - L. Bruce Richmond; Jeffrey O. Shallit (Electron. J. Comb., 2014)

Notes and Note-Pairs in Noergaard's Infinity Series. - Christopher Drexler-Lemire; Jeffrey O. Shallit (CoRR, 2014)

Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance. - Chen Fei Du; Hamoon Mousavi; Luke Schaeffer; Jeffrey O. Shallit (CoRR, 2014)

Similarity density of the Thue-Morse word with overlap-free infinite binary words. - Chen Fei Du; Jeffrey O. Shallit (AFL, 2014)

Reviewing the Early Days of Computing [Book Review]. - Jeffrey O. Shallit (Comput. Sci. Eng., 2014)

Avoiding Three Consecutive Blocks of the Same Size and Same Sum. - Julien Cassaigne; James D. Currie; Luke Schaeffer; Jeffrey O. Shallit (J. ACM, 2014)

A New Approach to the Paperfolding Sequences. - Daniel Goc; Hamoon Mousavi; Luke Schaeffer; Jeffrey O. Shallit (CiE, 2015)

Mechanical Proofs of Properties of the Tribonacci Word. - Hamoon Mousavi; Jeffrey O. Shallit (WORDS, 2015)

Factorization in Formal Languages. - Paul C. Bell; Daniel Reidenbach; Jeffrey O. Shallit (DLT, 2015)

Hankel Matrices for the Period-Doubling Sequence. - Robbert J. Fokkink; Cor Kraaikamp; Jeffrey O. Shallit (CoRR, 2015)

On the Combinatorics of Palindromes and Antipalindromes. - Chuan Guo 001; Jeffrey O. Shallit; Arseny M. Shur (CoRR, 2015)

Closed, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences. - Luke Schaeffer; Jeffrey O. Shallit (CoRR, 2015)

Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words. - Chen Fei Du; Jeffrey O. Shallit; Arseny M. Shur (Int. J. Found. Comput. Sci., 2015)

Automatic Sets of Rational Numbers. - Eric Rowland; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2015)

Periods and Borders of Random Words. - Stepan Holub; Jeffrey O. Shallit (STACS, 2016)

Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences. - Luke Schaeffer; Jeffrey O. Shallit (Electron. J. Comb., 2016)

On the subword complexity of the fixed point of $a rightarrow aab$, $b rightarrow b$, and generalizations. - Jean-Paul Allouche; Jeffrey O. Shallit (CoRR, 2016)

Length of the continued logarithm algorithm on rational inputs. - Jeffrey O. Shallit (CoRR, 2016)

Minimum Critical Exponents for Palindromes. - Jeffrey O. Shallit (CoRR, 2016)

Periodicity in Rectangular Arrays. - Jeffrey O. Shallit; Taylor J. Smith (CoRR, 2016)

Minimal Elements for the Prime Numbers. - Curtis Bright; Raymond Devillers; Jeffrey O. Shallit (Exp. Math., 2016)

Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties. - Chen Fei Du; Hamoon Mousavi; Luke Schaeffer; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2016)

Remarks on Privileged Words. - Michael Forsyth; Amlesh Jayakumar; Jarkko Peltomäki; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2016)

Discriminators and k-Regular Sequences. - Sajed Haque; Jeffrey O. Shallit (Integers, 2016)

Palindromic rich words and run-length encodings. - Chuan Guo 001; Jeffrey O. Shallit; Arseny M. Shur (Inf. Process. Lett., 2016)

Decision algorithms for Fibonacci-automatic Words, I: Basic results. - Hamoon Mousavi; Luke Schaeffer; Jeffrey O. Shallit (RAIRO Theor. Informatics Appl., 2016)

Overpals, Underlaps, and Underpals. - Aayush Rajasekaran; Narad Rampersad; Jeffrey O. Shallit (WORDS, 2017)

Undecidability and Finite Automata. - Jörg Endrullis; Jeffrey O. Shallit; Tim Smith (DLT, 2017)

Fractional Coverings, Greedy Coverings, and Rectifier Networks. - Dmitry Chistikov 001; Szabolcs Iván; Anna Lubiw; Jeffrey O. Shallit (STACS, 2017)

Existential length universality. - Pawel Gawrychowski; Narad Rampersad; Jeffrey O. Shallit; Marek Szykula (CoRR, 2017)

A Class of Exponential Sequences with Shift-Invariant Discriminators. - Sajed Haque; Jeffrey O. Shallit (CoRR, 2017)

Sums of Palindromes: an Approach via Nested-Word Automata. - Aayush Rajasekaran; Jeffrey O. Shallit; Tim Smith (CoRR, 2017)

When is an automatic set an additive basis? - Jason P. Bell; Kathryn Hare; Jeffrey O. Shallit (CoRR, 2017)

Disjoint covering systems and the reversion of the Möbius series. - I. P. Goulden; L. Bruce Richmond; Jeffrey O. Shallit (CoRR, 2017)

A Taxonomy of Morphic Sequences. - Jean-Paul Allouche; Julien Cassaigne; Jeffrey O. Shallit; Luca Q. Zamboni (CoRR, 2017)

Periodicity in rectangular arrays. - Guilhem Gamard; Gwénaël Richomme; Jeffrey O. Shallit; Taylor J. Smith (Inf. Process. Lett., 2017)

Preface. - Cezar Câmpeanu; Florin Manea; Giovanni Pighizzini; Jeffrey O. Shallit (J. Autom. Lang. Comb., 2017)

Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability. - Chen Fei Du; Hamoon Mousavi; Eric Rowland; Luke Schaeffer; Jeffrey O. Shallit (Theor. Comput. Sci., 2017)

Abelian-square-rich words. - Gabriele Fici; Filippo Mignosi; Jeffrey O. Shallit (Theor. Comput. Sci., 2017)

Counting Subwords and Regular Languages. - Charles J. Colbourn; Ryan E. Dougherty; Thomas Finn Lidbetter; Jeffrey O. Shallit (DLT, 2018)

Rollercoasters and Caterpillars. - Therese Biedl; Ahmad Biniaz; Robert Cummings; Anna Lubiw; Florin Manea; Dirk Nowotka; Jeffrey O. Shallit (ICALP, 2018)

Lagrange's Theorem for Binary Squares. - P. Madhusudan; Dirk Nowotka; Aayush Rajasekaran; Jeffrey O. Shallit (MFCS, 2018)

Sums of Palindromes: an Approach via Automata. - Aayush Rajasekaran; Jeffrey O. Shallit; Tim Smith (STACS, 2018)

Common factors in automatic and Sturmian sequences. - Narad Rampersad; Jeffrey O. Shallit (CoRR, 2018)

Preface. - Jeffrey O. Shallit; Alexander Okhotin (Inf. Comput., 2018)

Critical Exponent of Infinite Balanced Words via the Pell Number System. - Aseem R. Baranwal; Jeffrey O. Shallit (WORDS, 2019)

Repetitions in Infinite Palindrome-Rich Words. - Aseem R. Baranwal; Jeffrey O. Shallit (WORDS, 2019)

Circularly Squarefree Words and Unbordered Conjugates: A New Approach. - Trevor Clokie; Daniel Gabric; Jeffrey O. Shallit (WORDS, 2019)

New Results on Pseudosquare Avoidance. - Tim Ng; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (WORDS, 2019)

Generalized de Bruijn Words and the State Complexity of Conjugate Sets. - Daniel Gabric; Stepan Holub; Jeffrey O. Shallit (DCFS, 2019)

Optimal Regular Expressions for Permutations. - Antonio Molina Lovett; Jeffrey O. Shallit (ICALP, 2019)

Waring's Theorem for Binary Powers. - Daniel M. Kane; Carlo Sanna; Jeffrey O. Shallit (Comb., 2019)

Continuants, Run Lengths, and Barry's Modified Pascal Triangle. - Lukas Spiegelhofer; Jeffrey O. Shallit (Electron. J. Comb., 2019)

Automatic sequences are also non-uniformly morphic. - Jean-Paul Allouche; Jeffrey O. Shallit (CoRR, 2019)

Words Avoiding Reversed Factors, Revisited. - Lukas Fleischer; Jeffrey O. Shallit (CoRR, 2019)

Words With Few Palindromes, Revisited. - Lukas Fleischer; Jeffrey O. Shallit (CoRR, 2019)

New Bounds on Antipowers in Binary Words. - Lukas Fleischer; Samin Riasat; Jeffrey O. Shallit (CoRR, 2019)

The Generalized Nagell-Ljunggren Problem: Powers with Repetitive Representations. - Andrew Bridy; Robert J. Lemke Oliver; Arlo Shallit; Jeffrey O. Shallit (Exp. Math., 2019)

Cobham's Theorem and Automaticity. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit; Manon Stipulanti (Int. J. Found. Comput. Sci., 2019)

Circular critical exponents for Thue-Morse factors. - Jeffrey O. Shallit; Ramin Zarifi (RAIRO Theor. Informatics Appl., 2019)

Rollercoasters: Long Sequences without Short Runs. - Therese Biedl; Ahmad Biniaz; Robert Cummings; Anna Lubiw; Florin Manea; Dirk Nowotka; Jeffrey O. Shallit (SIAM J. Discret. Math., 2019)

The number of valid factorizations of Fibonacci prefixes. - Pierre Bonardo; Anna E. Frid; Jeffrey O. Shallit (Theor. Comput. Sci., 2019)

Critical exponents of infinite balanced words. - Narad Rampersad; Jeffrey O. Shallit; Élise Vandomme (Theor. Comput. Sci., 2019)

Subword complexity and power avoidance. - Jeffrey O. Shallit; Arseny M. Shur (Theor. Comput. Sci., 2019)

The State Complexity of Lexicographically Smallest Words and Computing Successors. - Lukas Fleischer; Jeffrey O. Shallit (DLT, 2020)

Existential Length Universality. - Pawel Gawrychowski; Martin Lange; Narad Rampersad; Jeffrey O. Shallit; Marek Szykula (STACS, 2020)

Queens in Exile: Non-attacking Queens on Infinite Chess Boards. - F. Michel Dekking; Jeffrey O. Shallit; Neil J. A. Sloane (Electron. J. Comb., 2020)

Extremal Overlap-Free and Extremal $ beta$-Free Binary Words. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (Electron. J. Comb., 2020)

Avoidance of split overlaps. - Daniel Gabric; Jeffrey O. Shallit (CoRR, 2020)

Decidability and k-Regular Sequences. - Daniel Krenn; Jeffrey O. Shallit (CoRR, 2020)

A Frameless 2-Coloring of the Plane Lattice. - Craig S. Kaplan; Jeffrey O. Shallit (CoRR, 2020)

Extremal overlap-free and extremal β-free binary words. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2020)

The Largest Entry in the Inverse of a Vandermonde Matrix. - Carlo Sanna; Jeffrey O. Shallit; Shun Zhang (CoRR, 2020)

Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture. - Jeffrey O. Shallit (CoRR, 2020)

Abelian Complexity and Synchronization. - Jeffrey O. Shallit (CoRR, 2020)

String Attractors for Automatic Sequences. - Jeffrey O. Shallit (CoRR, 2020)

Sum-free sets generated by the period-k-folding sequences and some Sturmian sequences. - Jean-Paul Allouche; Jeffrey O. Shallit; Zhi-Xiong Wen; Wen Wu 002; Jie-Meng Zhang (Discret. Math., 2020)

Additive Number Theory via Approximation by Regular Languages. - Jason P. Bell; Thomas F. Lidbetter; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2020)

New bounds on antipowers in words. - Lukas Fleischer; Samin Riasat; Jeffrey O. Shallit (Inf. Process. Lett., 2020)

Lengths of words accepted by nondeterministic finite automata. - Aaron Potechin; Jeffrey O. Shallit (Inf. Process. Lett., 2020)

Additive Number Theory via Automata Theory. - Aayush Rajasekaran; Jeffrey O. Shallit; Tim Smith (Theory Comput. Syst., 2020)

Unique decipherability in formal languages. - Paul C. Bell; Daniel Reidenbach; Jeffrey O. Shallit (Theor. Comput. Sci., 2020)

Enumerating regular expressions and their languages. - Hermann Gruber; Jonathan Lee 005; Jeffrey O. Shallit (Handbook of Automata Theory (I.), 2021)

Synchronized Sequences. - Jeffrey O. Shallit (WORDS, 2021)

Computational Fun with Sturdy and Flimsy Numbers. - Trevor Clokie; Thomas F. Lidbetter; Antonio Molina Lovett; Jeffrey O. Shallit; Leon Witzman (FUN, 2021)

Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs. - Jeffrey O. Shallit (CIAA, 2021)

Frobenius Numbers and Automatic Sequences. - Jeffrey O. Shallit (CoRR, 2021)

Hilbert's spacefilling curve described by automatic, regular, and synchronized sequences. - Jeffrey O. Shallit (CoRR, 2021)

Additive Number Theory via Automata and Logic. - Jeffrey O. Shallit (CoRR, 2021)

Avoidance of split overlaps. - Daniel Gabric; Jeffrey O. Shallit; Xiaofeng Zhong (Discret. Math., 2021)

Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages. - Lukas Fleischer; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2021)

An Inequality for the Number of Periods in a Word. - Daniel Gabric; Narad Rampersad; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2021)

Borders, palindrome prefixes, and square prefixes. - Daniel Gabric; Jeffrey O. Shallit (Inf. Process. Lett., 2021)

Robbins and Ardila meet Berstel. - Jeffrey O. Shallit (Inf. Process. Lett., 2021)

The simplest binary word with only three squares. - Daniel Gabric; Jeffrey O. Shallit (RAIRO Theor. Informatics Appl., 2021)

Automata, Palindromes, and Reversed Subwords. - Lukas Fleischer; Jeffrey O. Shallit (J. Autom. Lang. Comb., 2021)

Ostrowski-automatic sequences: Theory and applications. - Aseem R. Baranwal; Luke Schaeffer; Jeffrey O. Shallit (Theor. Comput. Sci., 2021)

Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk). - Jeffrey O. Shallit (CPM, 2022)

Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton. - Narad Rampersad; Jeffrey O. Shallit (Electron. J. Comb., 2022)

Quotients of Palindromic and Antipalindromic Numbers. - James Haoyu Bai; Joseph Meleshko; Samin Riasat; Jeffrey O. Shallit (CoRR, 2022)

Intertwining of Complementary Thue-Morse Factors. - Jeffrey O. Shallit (CoRR, 2022)

The First-Order Theory of Binary Overlap-Free Words is Decidable. - Luke Schaeffer; Jeffrey O. Shallit (CoRR, 2022)

Complement Avoidance in Binary Words. - James D. Currie; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2022)

Some Tribonacci Conjectures. - Jeffrey O. Shallit (CoRR, 2022)

Counterexamples to a Conjecture of Dombi in Additive Number Theory. - Jason P. Bell; Jeffrey O. Shallit (CoRR, 2022)

Sumsets associated with Beatty sequences. - Phakhinkon Phunphayap; Prapanpong Pongsriiam; Jeffrey O. Shallit (Discret. Math., 2022)

Maximal state complexity and generalized de Bruijn words. - Daniel Gabric; Stepan Holub; Jeffrey O. Shallit (Inf. Comput., 2022)

Automatic sequences of rank two. - Jason P. Bell; Jeffrey O. Shallit (RAIRO Theor. Informatics Appl., 2022)

Sumsets of Wythoff sequences, Fibonacci representation, and beyond. - Jeffrey O. Shallit (Period. Math. Hung., 2022)

Lie complexity of words. - Jason P. Bell; Jeffrey O. Shallit (Theor. Comput. Sci., 2022)

Computational aspects of sturdy and flimsy numbers. - Trevor Clokie; Thomas F. Lidbetter; Antonio Molina Lovett; Jeffrey O. Shallit; Leon Witzman (Theor. Comput. Sci., 2022)

Properties of a class of Toeplitz words. - Gabriele Fici; Jeffrey O. Shallit (Theor. Comput. Sci., 2022)

Decidability and k-regular sequences. - Daniel Krenn; Jeffrey O. Shallit (Theor. Comput. Sci., 2022)

Smallest and Largest Block Palindrome Factorizations. - Daniel Gabric; Jeffrey O. Shallit (WORDS, 2023)

Dyck Words, Pattern Avoidance, and Automatic Sequences. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (WORDS, 2023)

Proving Results About OEIS Sequences with Walnut. - Jeffrey O. Shallit (CICM, 2023)

Transduction of Automatic Sequences and Applications. - Jeffrey O. Shallit; Anatoly Zavyalov (CIAA, 2023)

Proof of a conjecture of Krawchuk and Rampersad. - Jeffrey O. Shallit (CoRR, 2023)

A Dombi Counterexample with Positive Lower Density. - Jeffrey O. Shallit (CoRR, 2023)

Prefixes of the Fibonacci word. - Jeffrey O. Shallit (CoRR, 2023)

Rarefied Thue-Morse Sums Via Automata Theory and Logic. - Jeffrey O. Shallit (CoRR, 2023)

Proving Properties of φ-Representations with the Walnut Theorem-Prover. - Jeffrey O. Shallit (CoRR, 2023)

A General Approach to Proving Properties of Fibonacci Representations via Automata Theory. - Jeffrey O. Shallit; Sonja Linghui Shan (AFL, 2023)

Proof of Irvine's Conjecture via Mechanized Guessing. - Jeffrey O. Shallit (CoRR, 2023)

New constructions for 3-free and 3+-free binary morphisms. - Jeffrey O. Shallit; Arseny M. Shur; Stefan Zorcic (CoRR, 2023)

Repetition factorization of automatic sequences. - Jeffrey O. Shallit; Xinhao Xu (CoRR, 2023)

Some Fibonacci-Related Sequences. - Benoit Cloitre; Jeffrey O. Shallit (CoRR, 2023)

Antisquares and Critical Exponents. - Aseem R. Baranwal; James D. Currie; Lucas Mol; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (Discret. Math. Theor. Comput. Sci., 2023)

Pseudoperiodic Words and a Question of Shevelev. - Joseph Meleshko; Pascal Ochem; Jeffrey O. Shallit; Sonja Linghui Shan (Discret. Math. Theor. Comput. Sci., 2023)

Mesosome avoidance. - Robert Cummings; Jeffrey O. Shallit; Paul Staadecker (Inf. Process. Lett., 2023)

Properties of a ternary infinite word. - James D. Currie; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (RAIRO Theor. Informatics Appl., 2023)

Automatic sequences in negative bases and proofs of some conjectures of shevelev. - Jeffrey O. Shallit; Sonja Linghui Shan; Kai-Hsiang Yang (RAIRO Theor. Informatics Appl., 2023)

Note on a Fibonacci parity sequence. - Jeffrey O. Shallit (Cryptogr. Commun., 2023)

Additive Word Complexity and Walnut. - Pierre Popoli; Jeffrey O. Shallit; Manon Stipulanti (FSTTCS, 2024)

Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals. - Aaron Barnoff; Curtis Bright; Jeffrey O. Shallit (CIAA, 2024)

State Complexity of the Minimal Star Basis. - Jozef Jirásek 001; Galina Jirásková; Jeffrey O. Shallit (CIAA, 2024)

Strongly k-recursive sequences. - Daniel Krenn; Jeffrey O. Shallit (CoRR, 2024)

Beatty Sequences for a Quadratic Irrational: Decidability and Applications. - Luke Schaeffer; Jeffrey O. Shallit; Stefan Zorcic (CoRR, 2024)

Consecutive Power Occurrences in Sturmian Words. - Jason P. Bell; Christian Schulz 013; Jeffrey O. Shallit (CoRR, 2024)

Repetition Threshold for Binary Automatic Sequences. - Jean-Paul Allouche; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2024)

The reflection complexity of sequences over finite alphabets. - Jean-Paul Allouche; John M. Campbell 001; Jeffrey O. Shallit; Manon Stipulanti (CoRR, 2024)

The Repetition Threshold for Rote Sequences. - Nicolas Ollinger; Jeffrey O. Shallit (CoRR, 2024)

Some Remarks on Palindromic Periodicities. - Gabriele Fici; Jeffrey O. Shallit; Jamie Simpson (CoRR, 2024)

Christoffel Matrices and Sturmian Determinants. - Christophe Reutenauer; Jeffrey O. Shallit (CoRR, 2024)

Runs in Paperfolding Sequences. - Jeffrey O. Shallit (CoRR, 2024)

Power-free complementary binary morphisms. - Jeffrey O. Shallit; Arseny M. Shur; Stefan Zorcic (J. Comb. Theory, Ser. A, 2024)

Decidability for Sturmian words. - Philipp Hieronymi; Dun Ma; Reed Oei; Luke Schaeffer; Christian Schulz 013; Jeffrey O. Shallit (Log. Methods Comput. Sci., 2024)

Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers. - James D. Currie; Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (SIAM J. Discret. Math., 2024)

Proving properties of some greedily-defined integer recurrences via automata theory. - Jeffrey O. Shallit (Theor. Comput. Sci., 2024)

Record-setters in the Stern sequence. - Ali Keramatipour; Jeffrey O. Shallit (Discret. Math., 2024)

On Palindromic Periodicities. - Gabriele Fici; Jeffrey O. Shallit; Jamie Simpson (CPM, 2025)

Self-verifying Predicates in Büchi Arithmetic. - Mazen Khodier; Luke Schaeffer; Jeffrey O. Shallit (CIAA, 2025)

Combinatorics on words and generating Dirichlet series of automatic sequences. - Jean-Paul Allouche; Jeffrey O. Shallit; Manon Stipulanti (Discret. Math., 2025)

Repetition Factorization of Automatic Sequences. - Narad Rampersad; Jeffrey O. Shallit; Xinhao Xu (Int. J. Found. Comput. Sci., 2025)

Cloitre's Self-Generating Sequence. - Jeffrey O. Shallit (CoRR, 2025)

The Hurt-Sada Array and Zeckendorf Representations. - Jeffrey O. Shallit (CoRR, 2025)

An 'Experimental Mathematics' Approach to Stolarsky Interspersions via Automata Theory. - Jeffrey O. Shallit (CoRR, 2025)

The Narayana Morphism and Related Words. - Jeffrey O. Shallit (CoRR, 2025)

Rudin-Shapiro Sums Via Automata Theory and Logic. - Narad Rampersad; Jeffrey O. Shallit (Theory Comput. Syst., 2025)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences. - Jean-Michel Couvreur; Martin Delacourt; Nicolas Ollinger; Pierre Popoli; Jeffrey O. Shallit; Manon Stipulanti (CoRR, 2025)

The Reflection Complexity of Sequences Over Finite Alphabets. - Jean-Paul Allouche; John M. Campbell 001; Shuo Li; Jeffrey O. Shallit; Manon Stipulanti (Theory Comput. Syst., 2025)