Jeffrey Shallit

Q: What Schools Are Affiliated With Jeffrey Shallit

Jeffrey Shallit is affiliated with the following schools: University of California, Berkeley, University of Waterloo, University of California, San Diego, Princeton University, University of Chicago

Jeffrey Shallit's AcademicInfluence.com Rankings

Jeffrey Shallit

Computer Science

#1526

World Rank

#1580

Historical Rank

#752

USA Rank

Theoretical Computer Science

#92

World Rank

#92

Historical Rank

#26

USA Rank

computer-science Degrees

Jeffrey Shallit

Mathematics

#1979

World Rank

#3131

Historical Rank

#795

USA Rank

Measure Theory

#1462

World Rank

#1831

Historical Rank

#496

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Why Is Jeffrey Shallit Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jeffrey Outlaw Shallit is an American computer scientist and mathematician. He is an active number theorist and a noted critic of intelligent design. He is married to Anna Lubiw, also a computer scientist.

(See a Problem?)

Jeffrey Shallit's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Algorithmic Number Theory (1996) (898)
Automatic Sequences - Theory, Applications, Generalizations (2003) (489)
The Ubiquitous Prouhet-Thue-Morse Sequence (1998) (425)
Automatic Sequences: Contents (2003) (339)
The Ring of k-Regular Sequences (1990) (242)
A Second Course in Formal Languages and Automata Theory (2008) (207)
The ring of k-regular sequences, II (2003) (176)
The Computational Complexity of Some Problems of Linear Algebra (1996) (149)
Regular Expressions: New Results and Open Problems (2004) (142)
Unary Language Operations, State Complexity and Jacobsthal's Function (2002) (123)
A Lower Bound Technique for the Size of Nondeterministic Finite Automata (1996) (118)
Randomized algorithms in number theory (1985) (106)
ALGEBRAIC COMBINATORICS ON WORDS (Encyclopedia of Mathematics and its Applications 90) By M. LOTHAIRE: 504 pp., £60.00, ISBN 0 521 81220 8 (Cambridge University Press, 2002) (2003) (103)
Numeration Systems, Linear Recurrences, and Regular Sets (1994) (99)
Simple continued fractions for some irrational numbers, II (1979) (95)
On the iteration of certain quadratic maps over GF(p) (2004) (93)
On the Number of Distinct Languages Accepted by Finite Automata with n States (2002) (84)
Characterizing Regular Languages with Polynomial Densities (1992) (82)
Proving Darwin: Making Biology Mathematical (2012) (76)
Polynomial versus exponential growth in repetition-free binary words (2003) (75)
Enumeration and Decidable Properties of Automatic Sequences (2011) (73)
Factoring with cyclotomic polynomials (1985) (63)
A Generalization of Automatic Sequences (1988) (62)
Automaticity I: Properties of a Measure of Descriptional Complexity (1996) (61)
Folded continued fractions (1992) (61)
Automatic Sequences: Frequency of Letters (2003) (60)
Counting Abelian Squares (2008) (57)
Sums of Digits, Overlaps, and Palindromes (2000) (55)
Periodicity, repetitions, and orbits of an automatic sequence (2008) (54)
On NFAs where all states are final, initial, or both (2008) (51)
Automaticity: Properties of a Measure of Descriptional Complexity (1994) (50)
Factor refinement (1993) (47)
Avoiding large squares in infinite binary words (2003) (47)
Automatic Sequences: Cobham's Theorem (2003) (47)
Automatic Complexity of Strings (2001) (46)
Neverending Fractions: An Introduction to Continued Fractions (2014) (44)
Sums of divisors, perfect numbers, and factoring (1984) (43)
Decision algorithms for Fibonacci-automatic Words, I: Basic results (2016) (41)
A generalization of repetition threshold (2003) (40)
Two methods for generating fractals (1989) (40)
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds (2002) (38)
Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance (2014) (37)
State complexity and the monoid of transformations of a finite set (2003) (35)
Continued fractions and linear recurrences (1993) (34)
Avoiding Three Consecutive Blocks of the Same Size and Same Sum (2011) (34)
Information theory, evolutionary computation, and Dembski’s “complex specified information” (2009) (33)
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time (2010) (33)
Origins of the analysis of the Euclidean algorithm (1994) (32)
The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages (2009) (32)
Automatic Theorem-Proving in Combinatorics on Words (2012) (32)
Enumerating Regular Expressions and Their Languages (2004) (32)
Extremal Infinite Overlap-Free Binary Words (1998) (29)
Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties (2016) (29)
The Frobenius Problem and Its Generalizations (2008) (28)
Automaticity II: Descriptional Complexity in the Unary Case (1997) (28)
Closures in Formal Languages and Kuratowski's Theorem (2009) (27)
Every real number greater than 1 is a critical exponent (2007) (27)
A binary algorithm for the Jacobi symbol (1993) (27)
Wire bending (1989) (27)
Simultaneous Avoidance Of Large Squares And Fractional Powers In Infinite Binary Words (2003) (26)
The Critical Exponent is Computable for Automatic Sequences (2011) (25)
Infinite Products Associated with Counting Blocks in Binary Strings (1989) (24)
What this country needs is an 18c piece (2003) (24)
Morphisms, Squarefree Strings, and the Tower of Hanoi Puzzle (1994) (24)
Mechanical Proofs of Properties of the Tribonacci Word (2014) (24)
Automaticity IV: sequences, sets, and diversity (1996) (23)
On the Number of Unbordered Factors (2012) (23)
Continued fractions for some alternating series (1991) (23)
On the Number of Multiplicative Partitions (1983) (23)
Periodicity in rectangular arrays (2016) (23)
Subword Complexity of a Generalized Thue-Morse Word (1995) (22)
Decision problems for convex languages (2008) (22)
Unbounded Discrepancy in Frobenius Numbers (2010) (22)
Decidability and Enumeration for Automatic Sequences: A Survey (2013) (21)
Detecting palindromes, patterns and borders in regular languages (2007) (21)
Thue-Morse at Multiples of an Integer (2010) (20)
Avoiding Approximate Squares (2007) (20)
Linear fractional transformations of continued fractions with bounded partial quotients (1997) (19)
On the maximum number of distinct factors of a binary string (1993) (19)
Remarks on Separating Words (2011) (19)
Results and estimates on pseudopowers (1996) (18)
On infinite products associated with sums of digits (1985) (18)
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (2008) (18)
Words avoiding reversed subwords (2003) (18)
On the Vector Space of the Automatic Reals (1996) (18)
Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability (2017) (18)
A Specialised Continued Fraction (1993) (18)
On the Worst Case of Three Algorithms for Computing the Jacobi Symbol (1990) (17)
Efficient enumeration of words in regular languages (2009) (17)
Shuffling and Unshuffling (2011) (17)
The Frobenius Problem in a Free Monoid (2007) (17)
Squares and overlaps in the Thue-Morse sequence and some variants (2006) (17)
The computational complexity of the local postage stamp problem (2001) (16)
Three Series for the Generalized Golden Mean (2014) (16)
Decimations of languages and state complexity (2009) (16)
Automatic maps in exotic numeration systems (1997) (16)
The Subword Complexity of k-Automatic Sequences is k-Synchronized (2012) (16)
The 2-adic valuation of the coefficients of a polynomial (2003) (16)
Palindromic rich words and run-length encodings (2016) (16)
Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences (2015) (16)
Sums of digits and the Hurwitz zeta function (1990) (16)
Mathematics by Experiment and Experimentation in (2005) (15)
What This Country Needs is an 18¢ Pie (2003) (15)
Additive Number Theory via Automata Theory (2019) (15)
Binary Words Containing Infinitely Many Overlaps (2005) (15)
When is an automatic set an additive basis? (2017) (15)
Summation of series defined by counting blocks of digits (2005) (15)
Critical exponents of infinite balanced words (2018) (15)
New bounds on the length of finite pierce and Engel series (1991) (15)
On integer sequences whose first iterates are linear (2005) (14)
Automaticity III: Polynomial automaticity and context-free languages (1998) (14)
Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences (2008) (14)
The "3x + 1" Problem and Finite Automata (1992) (14)
APPLIED COMBINATORICS ON WORDS (Encyclopedia of Mathematics and its Applications 105) (2007) (14)
Avoiding squares and overlaps over the natural numbers (2009) (14)
On two-sided infinite fixed points of morphisms (1999) (14)
Convergents of folded continued fractions (1996) (14)
Critical exponent of infinite balanced words via the Pell number system (2019) (14)
Subword complexity and power avoidance (2018) (13)
Morphic and Automatic Words: Maximal Blocks and Diophantine Approximation (2008) (13)
Simulating finite automata with context-free grammars (2002) (13)
The Cycles of the Multiway Perfect Shuffle Permutation (2002) (12)
Number Theory and Formal Languages (1999) (12)
The State Complexity of Star-Complement-Star (2012) (12)
On the Combinatorics of Palindromes and Antipalindromes (2015) (12)
Words avoiding repetitions in arithmetic progressions (2006) (12)
Lengths of Words Accepted by Nondeterministic Finite Automata (2018) (12)
Subword Complexity and k-Synchronization (2012) (12)
Number-Theoretic Functions Which Are Equivalent to Number of Divisors (1985) (11)
Periodicity, morphisms, and matrices (2003) (10)
Repetition Avoidance in Circular Factors (2012) (10)
Sturmian graphs and integer representations over numeration systems (2012) (10)
Minimal Covers of Formal Languages (2001) (10)
EXPLICIT DESCRIPTIONS OF SOME CONTINUED FRACTIONS (1981) (10)
Periods and borders of random words (2015) (9)
Inverse star, borders, and palstars (2010) (9)
Queens in Exile: Non-attacking Queens on Infinite Chess Boards (2019) (9)
Self-generating sets, integers with missing blocks, and substitutions (2005) (9)
Why Us? How Science Rediscovered the Mystery of Ourselves • James Le Fanu (2011) (9)
On lacunary formal power series and their continued fraction expansion (1999) (9)
More infinite products: Thue–Morse and the gamma function (2017) (9)
Efficient Enumeration of Regular Languages (2007) (9)
Remarks on Privileged Words (2013) (9)
An exposition of Pollard''s algorithm for quadratic congruences (1984) (9)
Waring’s Theorem for Binary Powers (2018) (8)
Variations on a Theorem of Fine & Wilf (2001) (8)
On Sturmian graphs (2007) (8)
Sums of Palindromes: an Approach via Automata (2017) (8)
Van der Waerden's Theorem and Avoidability in Words (2008) (8)
Avoiding 3/2-powers over the natural numbers (2011) (8)
Analysis of a Left-Shift Binary GCD Algorithm (1994) (8)
PIERCE EXPANSIONS AND RULES FOR THE DETERMINATION OF LEAP YEARS (2010) (8)
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences (2012) (8)
Detecting patterns in finite regular and context-free languages (2009) (8)
A VARIANT OF HOFSTADTER’S SEQUENCE AND FINITE AUTOMATA (2011) (8)
Additive Number Theory via Approximation by Regular Languages (2018) (8)
Extremal overlap-free and extremal β-free binary words (2020) (8)
String Attractors for Automatic Sequences (2020) (7)
State complexity of unique rational operations (2009) (7)
Sets Represented as the Length-n Factors of a Word (2013) (7)
Decidability for Sturmian words (2021) (7)
Non-Uniqueness and Radius of Cyclic Unary NFAs (2005) (7)
Discriminators and k-Regular Sequences (2016) (7)
New problems of pattern avoidance (2000) (7)
State Complexity and Jacobsthal's Function (2000) (7)
Separating Words with Small Grammars (1999) (7)
Minimal Elements for the Prime Numbers (2016) (7)
Circular critical exponents for Thue-Morse factors (2018) (7)
No Free Lunch: Why Specified Complexity Cannot be Purchased Without Intelligence, William Dembski, Rowman and Littlefield, 2002 (2002) (7)
An NP-hardness Result on the Monoid Frobenius Problem (2008) (6)
Counting the Palstars (2013) (6)
Lagrange's Theorem for Binary Squares (2017) (6)
Ostrowski-automatic sequences: Theory and applications (2021) (6)
AUTOMATIC MAPS ON A SEMIRING WITH DIGITS (1995) (6)
Fife's Theorem Revisited (2011) (6)
Some Facts About Continued Fractions That Should Be Better Known (1991) (6)
A Continued Fraction Algorithm for Approximating All Real Polynomial Roots (1978) (6)
Kuratowski's Theorem for Two Closure Operators (2011) (6)
Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract) (1992) (6)
An inequality for non-negative matrices II (1999) (6)
Automata and Reduced Words in the Free Group (2009) (6)
Circularly squarefree words and unbordered conjugates: a new approach (2019) (6)
Natural exact covering systems and the reversion of the Möbius series (2017) (6)
Abelian-square-rich words (2017) (6)
On Minimal Words With Given Subword Complexity (1998) (6)
THE MATHEMATICS OF PER NØRGÅRD ’ S RHYTHMIC INFINITY SYSTEM (2002) (5)
Sumsets of Wythoff sequences, Fibonacci representation, and beyond (2020) (5)
Rollercoasters: Long Sequences without Short Runs (2019) (5)
New results on pseudosquare avoidance (2019) (5)
Hankel Matrices for the Period-Doubling Sequence (2015) (5)
Repetitions in infinite palindrome-rich words (2019) (5)
Composition and orbits of language operations: finiteness and upper bounds (2011) (5)
Decidability and Shortest Strings in Formal Languages (2011) (5)
Fractional Coverings, Greedy Coverings, and Rectifier Networks (2015) (5)
Discovery of a lost factoring machine (1995) (5)
A New Approach to the Paperfolding Sequences (2015) (5)
Counting Subwords and Regular Languages (2018) (5)
Optimal Regular Expressions for Permutations (2018) (5)
Automatic Sets of Rational Numbers (2011) (5)
An Unusual Continued Fraction (2015) (5)
Enumeration and Automatic Sequences (2015) (5)
k-Automatic Sets of Rational Numbers (2012) (5)
How to prove that a sequence is not automatic (2021) (4)
A pattern sequence approach to Stern's sequence (2011) (4)
Randomized algorithms in “primitive” cultures or what is the oracle complexity of a dead chicken? (1992) (4)
Finite Automata, Palindromes, Powers, and Patterns (2008) (4)
Formal languages and number theory (2000) (4)
Length of the continued logarithm algorithm on rational inputs (2016) (4)
Science , Pseudoscience , and The Three Stages of Truth (4)
Lie complexity of words (2021) (4)
Finite Orbits of Language Operations (2011) (4)
Pattern Spectra, Substring Enumeration, and Automatic Sequences (1992) (4)
Descriptional Complexity of Formal Systems (2016) (4)
Handbook of Applied Cryptography. By Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone, The Cryptographic Imagination: Secret Writing from Edgar Poe to the Internet. By Shawn James Rosenheim (1999) (4)
Hamming distance for conjugates (2007) (4)
Automaticity and Rationality (2000) (4)
Closed, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences (2015) (4)
on Sparse Languages L such that LL = Sigma (1994) (4)
Fife's Theorem for (7/3)-Powers (2011) (4)
Sturmian Graphs and a Conjecture of Moser (2004) (3)
Abelian Complexity and Synchronization (2020) (3)
Analysis of an Infinite Product Algorithm (1989) (3)
Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture (2020) (3)
Automatic sequences are also non-uniformly morphic (2019) (3)
Fractals, bitmaps, and APL (1988) (3)
Finite automata, palindromes, patterns, and borders (2007) (3)
Robbins and Ardila meet Berstel (2020) (3)
Infinite arrays and diagonalization (1981) (3)
Primitive Words and Lyndon Words in Automatic Sequences (2012) (3)
An inequality for the number of periods in a word (2020) (3)
Existential length universality (2017) (3)
Maximal state complexity and generalized de Bruijn words (2019) (3)
A Taxonomy of Morphic Sequences (2017) (3)
Generalized de Bruijn words and the state complexity of conjugate sets (2019) (3)
The Generalized Nagell–Ljunggren Problem: Powers with Repetitive Representations (2017) (3)
Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton (2021) (3)
Decidability and k-Regular Sequences (2020) (3)
Common factors in automatic and Sturmian sequences (2018) (2)
Shortest Repetition-Free Words Accepted by Automata (2013) (2)
Automatic Sequences in Negative Bases and Proofs of Some Conjectures of Shevelev (2022) (2)
An efficient algorithm for computing the i th letter of 4 n a (1999) (2)
New Directions in State Complexity (2006) (2)
Advanced Problems: 6625-6627 (1990) (2)
Least periods of k-automatic sequences (2012) (2)
The number of valid factorizations of Fibonacci prefixes (2018) (2)
Neverending Fractions: Metric theory of continued fractions (2014) (2)
Sums of Palindromes: an Approach via Nested-Word Automata (2017) (2)
Words Avoiding Reversed Factors, Revisited (2019) (2)
Complement Avoidance in Binary Words (2022) (2)
A Class of Exponential Sequences with Shift-Invariant Discriminators (2017) (2)
Undecidability and Finite Automata (2017) (2)
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages (2021) (2)
Counterexamples to a Conjecture of Dombi in Additive Number Theory (2022) (2)
Counting Sequences with Small Discrepancies (2013) (2)
Cobham's Theorem and Automaticity (2018) (2)
Minimum Critical Exponents for Palindromes (2016) (2)
Closures in Formal Languages: Concatenation, Separation, and Algorithms (2009) (2)
Frobenius Numbers and Automatic Sequences (2021) (2)
Sum-free sets generated by the period-k-folding sequences and some Sturmian sequences (2019) (2)
Advanced Problems: 6448-6450 (1984) (2)
Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract) (1996) (2)
A class of functions equivalent to factoring (1984) (1)
The largest entry in the inverse of a Vandermonde matrix (2020) (1)
Additive Properties of the Evil and Odious Numbers and Similar Sequences (2021) (1)
Descriptional complexity of formal systems : 17th International Workshop, DCFS 2015 Waterloo, ON, Canada, June 25-27, 2015 : proceedings (2015) (1)
Proving Darwin • Gregory Chaitin (2013) (1)
Extremal Overlap-Free and Extremal $\beta$-Free Binary Words (2020) (1)
Parsing and recognition (2008) (1)
Properties of a Class of Toeplitz Words (2021) (1)
Unique decipherability in formal languages (2020) (1)
A Second Course in Formal Languages and Automata Theory: Review of formal languages and automata theory (2008) (1)
Automatic Sequences: Automatic Sequences (2003) (1)
The Tower of Hanoi and finite automata (2009) (1)
Notes and note pairs in Nørgård's infinity series (2014) (1)
Mini-Workshop: Combinatorics on Words (2010) (1)
A Frameless 2-Coloring of the Plane Lattice (2020) (1)
Two methods for the generation of fractal images (1987) (1)
Pseudoperiodic Words and a Question of Shevelev (2022) (1)
A subset coloring algorithm and its applications to computer graphics (1988) (1)
Intertwining of Complementary Thue-Morse Factors (2022) (1)
Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words (2015) (1)
Rudin-Shapiro Sums Via Automata Theory and Logic (2023) (1)
Correction to : “Linear fractional transformations of continued fractions with bounded partial quotients” (2003) (1)
Elementary Problems: E2920-E2925 (1982) (1)
Rarefied Thue-Morse Sums Via Automata Theory and Logic (2023) (1)
Antisquares and Critical Exponents (2022) (1)
Number Theory and Algebra (2003) (1)
An efficient algorithm for computing the ith letter of φ n (a) (1999) (1)
Weakly Self-Avoiding Words and a Construction of Friedman (2001) (1)
Length of the Shortest Word in the Intersection of Regular Languages (2009) (1)
Generalized Perturbed Symmetry (1998) (1)
On some conjectures of P. Barry (2020) (1)
k-Regular Sequences (2003) (1)
Dyck Words, Pattern Avoidance, and Automatic Sequences (2023) (1)
Description of Generalized Continued Fractions by Finite Automata (2013) (1)
Maximal Blocks in Morphic and Automatic Words (2008) (1)
Words With Few Palindromes, Revisited (2019) (1)
Enumeration of Context-Free Languages and Related Structures (2005) (1)
Elementary Problems: E2821-E2825 (1980) (1)
The prime factorization of 1 (1975) (1)
The Simplest Binary Word with Only Three Squares (2020) (1)
Multidimensional Automatic Sequences (2003) (1)
Predictable Regular Continued Cotangent Expansions (1976) (1)
Properties of a Ternary Infinite Word (2022) (1)
The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski (2017) (1)
Automatic Sequences of Rank Two (2021) (1)
Borders, Palindrome Prefixes, and Square Prefixes (2019) (1)
Finding the growth rate of a regular language in polynomial time (2007) (1)
Automatic Sequences: Numeration Systems (2003) (1)
On the Parity of the Number of Small Divisors of n (2015) (1)
The Erdős–Moser equation (2014) (1)
Rollercoasters and Caterpillars (2018) (1)
The State Complexity of Lexicographically Smallest Words and Computing Successors (2020) (0)
Social Issues in Canada's Information Society (1997) (0)
Automata, Palindromes, and Reversed Subwords (2021) (0)
Quotients of Palindromic and Antipalindromic Numbers (2022) (0)
NEW PROBLEMS OF PATTERN (1999) (0)
Cubefree binary words avoiding long squares (2003) (0)
New Bounds on Antipowers in Binary Words (2019) (0)
N T ] 4 M ay 2 01 5 An Unusual Continued Fraction (2018) (0)
Mathematics by Experiment and Experimentation in Mathematics (2004) (0)
Computational simplicial homology in APL (1982) (0)
Comparing Partial Sums with Their Penultimate Terms: 10433 (1998) (0)
Finite automata and regular languages (2008) (0)
On three conjectures of P. Barry (2020) (0)
Proof of a conjecture of Krawchuk and Rampersad (2023) (0)
F L ] 1 4 D ec 2 01 8 Cobham ’ s Theorem and Automaticity (2018) (0)
Formal Power Series (2003) (0)
Elementary Problems: E2968-E2973 (1982) (0)
Automatic Sequences and Related Topics Suites Automatiques Et Sujets Reliés (2006) (0)
A Second Course in Formal Languages and Automata Theory: Context-free grammars and languages (2008) (0)
Automatic Real Numbers (2003) (0)
Prefixes of the Fibonacci word (2023) (0)
Automatic Sequences: Stringology (2003) (0)
New bounds on antipowers in words (2019) (0)
An Interesting Continued Fraction (1975) (0)
Other language classes (2008) (0)
Periodicity and repetition in combinatorics on words (2004) (0)
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers (2021) (0)
Problems: 10431-10437 (1995) (0)
On numeration systems and Sturmian graphs (2005) (0)
Scripta Manent: Editing an Electronic Journal (2015) (0)
Neverending Fractions: Some preliminaries from number theory (2014) (0)
Smallest and Largest Block Palindrome Factorizations (2023) (0)
Computational Aspects of Sturdy and Flimsy Numbers (2020) (0)
#A2 INTEGERS 11 (2011) UNBOUNDED DISCREPANCY IN FROBENIUS NUMBERS (2011) (0)
Corrected proof of Theorem 2.7 in Allouche and Shallit (1992) (2020) (0)
Preface (2017) (0)
String Attractors for the Period-Doubling Sequence (2020) (0)
Automaticity and Rationality 1 (2000) (0)
Hyperelliptic curves and Somos sequences (2014) (0)
Quadratic irrationals through a magnifier (2014) (0)
On a construction of Friedman (2000) (0)
On the subword complexity of the fixed point of $a \rightarrow aab$, $b \rightarrow b$, and generalizations (2016) (0)
Automatic Sequences: Uniform Morphisms and Automatic Sequences (2003) (0)
Letter to the Editor (1976) (0)
Disjoint covering systems and the reversion of the Möbius series (2017) (0)
Similarity density of the Thue-Morse word with overlap-free infinite binary words (2014) (0)
Neverending Fractions: The integer part of qα + β (2014) (0)
0 N ov 2 00 7 Finite Automata , Palindromes , Patterns , and Borders (2007) (0)
Irregular continued fractions (2014) (0)
Number Theory (1999) (0)
Michel Mendès France, 1936–2018 (2019) (0)
Automatic Sequences: Finite Automata and Other Models of Computation (2003) (0)
A simple proof of the Lucas-Lehmer primality test (1984) (0)
An Efficient Algorithm for Computing the ith letter of 4na (1999) (0)
Table of Bell Numbers to B(400). (1978) (0)
An Efficient Algorithm for Computing the i th Letter of φ n ( a ) (2018) (0)
Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk) (2022) (0)
2 Avoiding reversed subwords (2003) (0)
Appendix A Selected continued fractions (2014) (0)
The First-Order Theory of Binary Overlap-Free Words is Decidable (2022) (0)
A Dombi Counterexample with Positive Lower Density (2023) (0)
Transduction of Automatic Sequences and Applications (2023) (0)
Automatic Sequences: Hints, References, and Solutions for Selected Exercises (2003) (0)
An efficient algorithm for computing the <?Pub Fmt italic>i<?Pub Fmt /italic>th letter of <inline-equation> <f> <g>4</g><sup>n</sup><fen lp="par">a<rp post="par"></fen></f> </inline-equation> (1999) (0)
The Generalized Fine-Wilf Theorem and Hamming Distance for Conjugates (2007) (0)
Review of biscuits of number theory by Arthur T. Benjamin and Ezra Brown (2012) (0)
Elementary Problems: E3031-E3034 (1984) (0)
Combinatorics on words (2008) (0)
Computational Fun with Sturdy and Flimsy Numbers (2021) (0)
Erratum “Automacity IV : sequences, sets, and diversity” (1997) (0)
Mesosome Avoidance (2021) (0)
347 Automaticity IV : Sequences , Sets , and Diversity par (2017) (0)
Reviewing the Early Days of Computing [Book Review] (2014) (0)
An application of the Lenstra-Lenstra-Lovasz algorithm to the solution of a diophantine equation (1984) (0)
Merrily we roll along: Some aspects of? (1983) (0)
Review of finite fields and applications by Gary L. Mullen and Carl Mummert (2012) (0)
Factorization in Formal Languages (2015) (0)
Overpals, Underlaps, and Underpals (2017) (0)
Filtrations of Formal Languages by Arithmetic Progressions (2011) (0)
From folding to Fibonacci (2014) (0)
A note on the relative complexity of sigma_k (N) and d(N) (1988) (0)
Avoidance of split overlaps (2020) (0)
Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) (1984) (0)
Badly approximable numbers, Kronecker’s theorem, and diversity of Sturmian characteristic sequences (2020) (0)
Cryptographic applications of analytic number theory: lower bounds and pseudorandomness author of book: Igor Shparlinski Birkäuser, 2003 (2010) (0)
Automatic Sequences: Automaticity (2003) (0)
Calculation of √5 and φ (the Golden Ratio) to 10,000 Decimal Places (1976) (0)
Elementary Problems: E2815-E2820 (1980) (0)
Review of computability and complexity theory by Steven Homer and Alan L. Selman (2013) (0)
Additive Number Theory via Automata Theory (2019) (0)
Proving Properties of $\varphi$-Representations with the Walnut Theorem-Prover (2023) (0)
On Lazy Representations and Sturmian Graphs (2010) (0)
Automatic Sequences: Characteristic Words (2003) (0)
A Second Course in Formal Languages and Automata Theory: Turing machines (2008) (0)
S ep 2 00 0 On a Construction of Friedman (2008) (0)

This paper list is powered by the following services:

Other Resources About Jeffrey Shallit

en.wikipedia.org

What Schools Are Affiliated With Jeffrey Shallit?

Jeffrey Shallit is affiliated with the following schools:

Jeffrey Shallit's Academic­Influence.com Rankings

Why Is Jeffrey Shallit Influential?

Jeffrey Shallit's Published Works

Published Works

Other Resources About Jeffrey Shallit

What Schools Are Affiliated With Jeffrey Shallit?

Image Attributions

Jeffrey Shallit's AcademicInfluence.com Rankings