Jeffrey O. Shallit

From MaRDI portal
Person:405317

Available identifiers

zbMath Open shallit.jeffrey-oWikidataQ92669 ScholiaQ92669MaRDI QIDQ405317

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61249592024-04-10Paper
A General Approach to Proving Properties of Fibonacci Representations via Automata Theory2024-04-09Paper
Proving results about OEIS sequences with \texttt{Walnut}2024-02-28Paper
Transduction of automatic sequences and applications2024-02-28Paper
Record-setters in the Stern sequence2024-02-19Paper
Proving properties of some greedily-defined Integer recurrences via automata theory2024-02-09Paper
Rarefied Thue-Morse sums via automata theory and logic2024-01-10Paper
https://portal.mardi4nfdi.de/entity/Q60931052023-09-06Paper
An Inequality for the Number of Periods in a Word2023-08-15Paper
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages2023-08-15Paper
Smallest and Largest Block Palindrome Factorizations2023-07-25Paper
Dyck Words, Pattern Avoidance, and Automatic Sequences2023-07-25Paper
Rudin-Shapiro Sums via Automata Theory and Logic2023-07-25Paper
Note on a Fibonacci parity sequence2023-06-20Paper
Counterexamples to a conjecture of Dombi in additive number theory2023-06-05Paper
Properties of a ternary infinite word2023-05-25Paper
Automatic sequences in negative bases and proofs of some conjectures of shevelev2023-05-25Paper
Badly approximable numbers, Kronecker's theorem, and diversity of Sturmian characteristic sequences2023-05-08Paper
Proving Properties of $\varphi$-Representations with the Walnut Theorem-Prover2023-05-04Paper
Prefixes of the Fibonacci word2023-02-09Paper
https://portal.mardi4nfdi.de/entity/Q58742872023-02-07Paper
A Dombi Counterexample with Positive Lower Density2023-02-04Paper
Proof of a conjecture of Krawchuk and Rampersad2023-01-26Paper
The largest entry in the inverse of a Vandermonde matrix2023-01-05Paper
The computational complexity of some problems of linear algebra2022-11-09Paper
Automatic sequences of rank two2022-10-31Paper
Mesosome avoidance2022-10-28Paper
https://portal.mardi4nfdi.de/entity/Q50423812022-10-19Paper
https://portal.mardi4nfdi.de/entity/Q50424392022-10-19Paper
The State Complexity of Lexicographically Smallest Words and Computing Successors2022-10-13Paper
Complement Avoidance in Binary Words2022-09-20Paper
The First-Order Theory of Binary Overlap-Free Words is Decidable2022-09-07Paper
Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton2022-09-06Paper
Characterizing regular languages with polynomial densities2022-08-18Paper
A generalization of automatic sequences2022-08-16Paper
Computational aspects of sturdy and flimsy numbers2022-08-10Paper
Lie complexity of words2022-08-10Paper
The Logical Approach to Automatic Sequences2022-08-01Paper
https://portal.mardi4nfdi.de/entity/Q50923232022-07-21Paper
Properties of a class of Toeplitz words2022-06-13Paper
Synchronized sequences2022-05-20Paper
How to prove that a sequence is not automatic2022-04-01Paper
Frobenius Numbers and Automatic Sequences2022-03-24Paper
Say no to case analysis: automating the drudgery of case-based proofs2022-03-22Paper
Sumsets associated with Beatty sequences2022-03-14Paper
Maximal state complexity and generalized de Bruijn words2022-03-14Paper
https://portal.mardi4nfdi.de/entity/Q50615252022-03-11Paper
Intertwining of Complementary Thue-Morse Factors2022-03-06Paper
Quotients of Palindromic and Antipalindromic Numbers2022-02-28Paper
Sumsets of Wythoff sequences, Fibonacci representation, and beyond2022-02-22Paper
Decidability and \(k\)-regular sequences2022-02-21Paper
The simplest binary word with only three squares2022-01-12Paper
A Frameless 2-Coloring of the Plane Lattice2022-01-11Paper
Additive Properties of the Evil and Odious Numbers and Similar Sequences2021-12-27Paper
Extending Dekking's construction of an infinite binary word avoiding abelian $4$-powers2021-11-15Paper
Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton2021-10-12Paper
Automatic sequences are also non-uniformly morphic2021-10-04Paper
https://portal.mardi4nfdi.de/entity/Q50051182021-08-04Paper
On some conjectures of P. Barry2021-08-02Paper
Mesosome Avoidance2021-07-29Paper
https://portal.mardi4nfdi.de/entity/Q50026842021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q49949472021-06-22Paper
Abelian Complexity and Synchronization2021-05-03Paper
Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture2021-04-23Paper
Additive Number Theory via Approximation by Regular Languages2021-04-19Paper
Robbins and Ardila meet Berstel2021-03-11Paper
Lie complexity of words2021-02-07Paper
Length of the continued logarithm algorithm on rational inputs2021-02-05Paper
Borders, palindrome prefixes, and square prefixes2021-02-04Paper
Ostrowski-automatic sequences: theory and applications2021-02-03Paper
Extremal overlap-free and extremal \(\beta\)-free binary words2020-12-13Paper
String Attractors for Automatic Sequences2020-12-12Paper
Avoidance of split overlaps2020-12-04Paper
Lengths of words accepted by nondeterministic finite automata2020-10-07Paper
New bounds on antipowers in words2020-10-07Paper
Robbins and Ardila meet Berstel2020-07-29Paper
Sum-free sets generated by the period-\(k\)-folding sequences and some Sturmian sequences2020-07-08Paper
Sumsets of Wythoff Sequences, Fibonacci Representation, and Beyond2020-06-07Paper
Decidability and k-Regular Sequences2020-05-19Paper
Generalized de Bruijn words and the state complexity of conjugate sets2020-05-12Paper
Queens in exile: non-attacking queens on infinite chess boards2020-03-30Paper
Waring's theorem for binary powers2020-02-26Paper
Computational Aspects of Sturdy and Flimsy Numbers2020-02-07Paper
Unique decipherability in formal languages2019-12-27Paper
Cobham’s Theorem and Automaticity2019-12-19Paper
Numeration systems, linear recurrences, and regular sets2019-12-04Paper
Words With Few Palindromes, Revisited2019-11-27Paper
Words Avoiding Reversed Factors, Revisited2019-11-26Paper
The Generalized Nagell–Ljunggren Problem: Powers with Repetitive Representations2019-11-25Paper
Natural exact covering systems and the reversion of the Möbius series2019-11-19Paper
Critical exponent of infinite balanced words via the Pell number system2019-11-06Paper
Repetitions in infinite palindrome-rich words2019-11-06Paper
Circularly squarefree words and unbordered conjugates: a new approach2019-11-06Paper
New results on pseudosquare avoidance2019-11-06Paper
Subword complexity and power avoidance2019-10-07Paper
Rollercoasters: Long Sequences without Short Runs2019-08-29Paper
A Class of Exponential Sequences with Shift-Invariant Discriminators2019-08-28Paper
Circular critical exponents for Thue–Morse factors2019-07-18Paper
Critical exponents of infinite balanced words2019-06-18Paper
More infinite products: Thue-Morse and the gamma function2019-06-18Paper
Michel Mendès France, 1936--20182019-06-05Paper
The number of valid factorizations of Fibonacci prefixes2019-05-29Paper
Continuants, run lengths, and Barry's modified Pascal triangle2019-03-15Paper
Maximal State Complexity and Generalized de Bruijn Words2019-03-13Paper
https://portal.mardi4nfdi.de/entity/Q45574072018-11-23Paper
Additive number theory via approximation by regular languages2018-11-22Paper
Counting subwords and regular languages2018-11-22Paper
https://portal.mardi4nfdi.de/entity/Q45848902018-09-04Paper
When is an automatic set an additive basis?2018-08-03Paper
Fractional coverings, greedy coverings, and rectifier networks2018-04-19Paper
Notes and note pairs in Nørgård's infinity series2018-03-16Paper
Common factors in automatic and Sturmian sequences2018-02-01Paper
Periods and borders of random words2018-01-24Paper
Overpals, underlaps, and underpals2017-11-15Paper
Lagrange's Theorem for Binary Squares2017-10-11Paper
Repetitions in words2017-10-06Paper
Abelian-square-rich words2017-06-15Paper
Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties2017-04-06Paper
Enumeration and Automatic Sequences2017-03-31Paper
Hankel matrices for the period-doubling sequence2017-01-18Paper
Discriminators and k-Regular Sequences2017-01-03Paper
Minimum Critical Exponents for Palindromes2016-12-15Paper
Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability2016-12-05Paper
Periodicity in rectangular arrays2016-11-23Paper
Palindromic rich words and run-length encodings2016-08-16Paper
Decision algorithms for Fibonacci-automatic Words, I: Basic results2016-08-12Paper
Remarks on Privileged Words2016-08-08Paper
Minimal Elements for the Prime Numbers2016-06-29Paper
On the Parity of the Number of Small Divisors of n2016-04-18Paper
Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words2016-04-15Paper
An unusual continued fraction2016-03-08Paper
Fife's Theorem for (7/3)-Powers2016-03-01Paper
The Critical Exponent is Computable for Automatic Sequences2016-03-01Paper
Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences2016-02-11Paper
Factorization in Formal Languages2015-11-10Paper
Mechanical Proofs of Properties of the Tribonacci Word2015-11-04Paper
A New Approach to the Paperfolding Sequences2015-10-20Paper
Automatic Sets of Rational Numbers2015-09-29Paper
Three Series for the Generalized Golden Mean2015-03-19Paper
Avoiding Three Consecutive Blocks of the Same Size and Same Sum2014-09-12Paper
Counting the palstars2014-09-04Paper
Neverending Fractions2014-07-09Paper
Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance2014-06-03Paper
AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS2014-03-10Paper
Composition and orbits of language operations: finiteness and upper bounds2013-10-22Paper
Sets Represented as the Length-n Factors of a Word2013-09-20Paper
Shortest Repetition-Free Words Accepted by Automata2013-08-09Paper
The Critical Exponent is Computable for Automatic Sequences2013-07-30Paper
Description of Generalized Continued Fractions by Finite Automata2013-07-23Paper
Subword Complexity and k-Synchronization2013-06-28Paper
Repetition Avoidance in Circular Factors2013-06-28Paper
Filtrations of Formal Languages by Arithmetic Progressions2013-06-27Paper
Counting Sequences with Small Discrepancies2013-06-24Paper
Decidability and Enumeration for Automatic Sequences: A Survey2013-06-14Paper
A VARIANT OF HOFSTADTER’S SEQUENCE AND FINITE AUTOMATA2013-06-13Paper
Inverse star, borders, and palstars2013-03-28Paper
The Frobenius Problem in a Free Monoid2013-03-19Paper
On the Number of Unbordered Factors2013-03-18Paper
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences2013-03-18Paper
ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES2013-01-18Paper
The State Complexity of Star-Complement-Star2012-11-02Paper
Automatic Theorem-Proving in Combinatorics on Words2012-09-20Paper
https://portal.mardi4nfdi.de/entity/Q28933122012-06-20Paper
k-Automatic Sets of Rational Numbers2012-06-08Paper
Sturmian graphs and integer representations over numeration systems2012-05-04Paper
Enumerating regular expressions and their languages2012-04-23Paper
A pattern sequence approach to Stern's sequence2012-04-13Paper
Avoiding 3/2-powers over the natural numbers2012-04-13Paper
Kuratowski's Theorem for Two Closure Operators2011-09-06Paper
Enumeration and Decidable Properties of Automatic Sequences2011-07-29Paper
Fife’s Theorem Revisited2011-07-29Paper
Decidability and Shortest Strings in Formal Languages2011-07-29Paper
Remarks on Separating Words2011-07-29Paper
Decision problems for convex languages2011-07-27Paper
Morphic and automatic words: maximal blocks and Diophantine approximation2011-06-15Paper
Finite Orbits of Language Operations2011-06-03Paper
Thue-Morse at multiples of an integer2011-05-23Paper
CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM2011-03-30Paper
Unbounded Discrepancy in Frobenius Numbers2011-03-09Paper
Van der Waerden's Theorem and Avoidability in Words2011-03-09Paper
On Lazy Representations and Sturmian Graphs2011-02-11Paper
FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME2010-09-06Paper
Detecting patterns in finite regular and context-free languages2010-09-02Paper
Counting abelian squares2010-03-26Paper
Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin–Shapiro sequences2010-01-14Paper
Avoiding squares and overlaps over the natural numbers2009-12-15Paper
Hamming distance for conjugates2009-12-09Paper
On NFAs where all states are final, initial, or both2009-11-06Paper
Efficient enumeration of words in regular languages2009-09-14Paper
Periodicity, repetitions, and orbits of an automatic sequence2009-08-07Paper
Closures in Formal Languages and Kuratowski’s Theorem2009-07-07Paper
Decimations of languages and state complexity2009-06-04Paper
State complexity of unique rational operations2009-06-04Paper
Decision Problems for Convex Languages2009-04-02Paper
A Second Course in Formal Languages and Automata Theory2008-12-23Paper
AVOIDING APPROXIMATE SQUARES2008-11-24Paper
The Frobenius Problem and Its Generalizations2008-10-30Paper
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time2008-10-30Paper
https://portal.mardi4nfdi.de/entity/Q35170962008-08-12Paper
Efficient Enumeration of Regular Languages2008-06-10Paper
Words avoiding repetitions in arithmetic progressions2008-03-05Paper
https://portal.mardi4nfdi.de/entity/Q54371812008-01-18Paper
Avoiding Approximate Squares2007-11-28Paper
Every real number greater than 1 is a critical exponent2007-09-03Paper
Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms2007-08-01Paper
On Sturmian graphs2007-05-30Paper
Binary words containing infinitely many overlaps2007-03-12Paper
Summation of series defined by counting blocks of digits2007-02-26Paper
Squares and overlaps in the Thue-Morse sequence and some variants2007-02-08Paper
https://portal.mardi4nfdi.de/entity/Q34138552006-12-18Paper
Developments in Language Theory2005-12-22Paper
A generalization of repetition threshold2005-12-06Paper
https://portal.mardi4nfdi.de/entity/Q57104432005-12-02Paper
https://portal.mardi4nfdi.de/entity/Q57043312005-11-14Paper
NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs2005-11-14Paper
https://portal.mardi4nfdi.de/entity/Q53137902005-09-01Paper
A generalization of repetition threshold2005-08-22Paper
Avoiding large squares in infinite binary words2005-06-30Paper
Correction to: Linear fractional transformations of continued fractions with bounded partial quotients2005-06-30Paper
UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION2005-06-22Paper
SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS2005-06-22Paper
On integer sequences whose first iterates are linear2005-04-29Paper
Self-generating sets, integers with missing blocks, and substitutions2005-04-28Paper
https://portal.mardi4nfdi.de/entity/Q46689082005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q47379192004-08-11Paper
Polynomial versus exponential growth in repetition-free binary words2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44653332004-05-27Paper
The ring of \(k\)-regular sequences. II.2004-03-14Paper
On the iteration of certain quadratic maps over GF(\(p\)).2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44534552004-03-07Paper
Automatic Sequences2003-10-19Paper
Periodicity, morphisms, and matrices.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q27089642003-07-09Paper
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.2003-05-14Paper
Simulating finite automata with context-free grammars.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q47791692002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45409752002-07-28Paper
https://portal.mardi4nfdi.de/entity/Q45313812002-05-29Paper
https://portal.mardi4nfdi.de/entity/Q43306172002-05-14Paper
On two-sided infinite fixed points of morphisms2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q45243272001-12-05Paper
Weakly self-avoiding words and a construction of Friedman2001-02-19Paper
https://portal.mardi4nfdi.de/entity/Q45031492000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q44858692000-06-20Paper
https://portal.mardi4nfdi.de/entity/Q49415092000-03-12Paper
Automaticity. III: Polynomial automaticity and context-free languages2000-02-12Paper
The computational complexity of some problems of linear algebra2000-02-08Paper
https://portal.mardi4nfdi.de/entity/Q49395752000-02-06Paper
An inequality for non-negative matrices2000-02-06Paper
https://portal.mardi4nfdi.de/entity/Q42521662000-01-31Paper
https://portal.mardi4nfdi.de/entity/Q49343562000-01-17Paper
Generalized perturbed symmetry1999-08-23Paper
https://portal.mardi4nfdi.de/entity/Q42523591999-06-17Paper
Linear fractional transformations of continued fractions with bounded partial quotients1998-11-22Paper
On minimal words with given subword complexity1998-07-27Paper
Automaticity. II: Descriptional complexity in the unary case1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q43758141998-06-11Paper
Extremal infinite overlap-free binary words1998-05-24Paper
Automaticity. IV: Sequences, sets, and diversity1997-11-26Paper
Automatic maps in exotic numeration systems1997-09-07Paper
AUTOMATIC MAPS ON A SEMIRING WITH DIGITS1997-05-28Paper
Origins of the analysis of the Euclidean algorithm1997-03-25Paper
Automaticity. I: Properties of a measure of descriptional complexity1997-03-13Paper
Subword complexity of a generalized Thue-Morse word1997-02-28Paper
On the vector space of the automatic reals1997-02-27Paper
A lower bound technique for the size of nondeterministic finite automata1997-02-27Paper
Results and estimates on pseudopowers1996-12-03Paper
Convergents of folded continued fractions1996-10-10Paper
https://portal.mardi4nfdi.de/entity/Q48887491996-08-19Paper
Discovery of a lost factoring machine1996-07-15Paper
https://portal.mardi4nfdi.de/entity/Q48479271996-06-19Paper
Complexity of generalized Rudin-Shapiro sequences1995-08-08Paper
https://portal.mardi4nfdi.de/entity/Q43231501995-03-19Paper
https://portal.mardi4nfdi.de/entity/Q43259571995-03-13Paper
Analysis of a left-shift binary GCD algorithm1995-01-22Paper
Continued Fractions and Linear Recurrences1994-10-20Paper
A Specialised Continued Fraction1994-10-20Paper
Numeration systems, linear recurrences, and regular sets1994-10-12Paper
On sparse languages \(L\) such that \(LL= \Sigma^*\)1994-09-27Paper
https://portal.mardi4nfdi.de/entity/Q31388941994-09-19Paper
Factor Refinement1994-04-04Paper
On the maximum number of distinct factors of a binary string1993-08-11Paper
https://portal.mardi4nfdi.de/entity/Q40337481993-05-16Paper
Real numbers with bounded partial quotients: A survey1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40051941992-09-27Paper
The ring of \(k\)-regular sequences1992-09-27Paper
Pattern spectra, substring enumeration, and automatic sequences1992-09-26Paper
Folded continued fractions1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39759281992-06-26Paper
Continued fractions for some alternating series1991-01-01Paper
New bounds on the length of finite pierce and Engel series1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34954111990-01-01Paper
On the worst case of three algorithms for computing the Jacobi symbol1990-01-01Paper
Infinite Products Associated with Counting Blocks in Binary Strings1989-01-01Paper
Factoring with Cyclotomic Polynomials1989-01-01Paper
Analysis of an Infinite Product Algorithm1989-01-01Paper
Wire bending1989-01-01Paper
Sur des points fixes de morphismes d'un monoïde libre1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34971291988-01-01Paper
A generalization of automatic sequences1988-01-01Paper
De nouveaux curieux produits infinis1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37317111986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37442171986-01-01Paper
Sums of Divisors, Perfect Numbers and Factoring1986-01-01Paper
Randomized algorithms in number theory1986-01-01Paper
On infinite products associated with sums of digits1985-01-01Paper
Number-theoretic functions which are equivalent to number of divisors1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33375301984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33383171984-01-01Paper
On the Number of Multiplicative Partitions1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39266681982-01-01Paper
Simple continued fractions for some irrational numbers. II1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36616561980-01-01Paper
Simple continued fractions for some irrational numbers1979-01-01Paper
Predictable regular continued cotangent expansions1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40476231975-01-01Paper
An Interesting Continued Fraction1975-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jeffrey O. Shallit