| Publication | Date of Publication | Type |
|---|
| Using finite automata to compute the base-\(b\) representation of the golden ratio and other quadratic irrationals | 2025-01-20 | Paper |
| State complexity of the minimal star basis | 2025-01-20 | Paper |
| Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers | 2024-12-18 | Paper |
| Consecutive power occurrences in Sturmian words | 2024-11-06 | Paper |
| The first-order theory of binary overlap-free words is decidable | 2024-10-22 | Paper |
| Dyck words, pattern avoidance, and automatic sequences | 2024-10-08 | Paper |
| Pseudoperiodic words and a question of Shevelev | 2024-09-06 | Paper |
| Antisquares and critical exponents | 2024-09-06 | Paper |
| Decidability for Sturmian words | 2024-09-04 | Paper |
| Power-free complementary binary morphisms | 2024-07-03 | Paper |
| Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence | 2024-05-30 | Paper |
| Using automata and a decision procedure to prove results in pattern matching (invited talk) | 2024-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6124959 | 2024-04-10 | Paper |
| A General Approach to Proving Properties of Fibonacci Representations via Automata Theory | 2024-04-09 | Paper |
| Proving results about OEIS sequences with \texttt{Walnut} | 2024-02-28 | Paper |
| Transduction of automatic sequences and applications | 2024-02-28 | Paper |
| Record-setters in the Stern sequence | 2024-02-19 | Paper |
| Proving properties of some greedily-defined Integer recurrences via automata theory | 2024-02-09 | Paper |
| Rarefied Thue-Morse sums via automata theory and logic | 2024-01-10 | Paper |
| Repetition factorization of automatic sequences | 2023-11-25 | Paper |
| Power-free Complementary Binary Morphisms | 2023-10-23 | Paper |
| Proof of Irvine's Conjecture via Mechanized Guessing | 2023-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6093105 | 2023-09-06 | Paper |
| An Inequality for the Number of Periods in a Word | 2023-08-15 | Paper |
| Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages | 2023-08-15 | Paper |
| Smallest and Largest Block Palindrome Factorizations | 2023-07-25 | Paper |
| Dyck Words, Pattern Avoidance, and Automatic Sequences | 2023-07-25 | Paper |
| Rudin-Shapiro Sums via Automata Theory and Logic | 2023-07-25 | Paper |
| Note on a Fibonacci parity sequence | 2023-06-20 | Paper |
| Counterexamples to a conjecture of Dombi in additive number theory | 2023-06-05 | Paper |
| Properties of a ternary infinite word | 2023-05-25 | Paper |
| Automatic sequences in negative bases and proofs of some conjectures of shevelev | 2023-05-25 | Paper |
| Badly approximable numbers, Kronecker's theorem, and diversity of Sturmian characteristic sequences | 2023-05-08 | Paper |
| Proving Properties of $\varphi$-Representations with the Walnut Theorem-Prover | 2023-05-04 | Paper |
| Prefixes of the Fibonacci word | 2023-02-09 | Paper |
| Existential length universality | 2023-02-07 | Paper |
| Computational fun with sturdy and flimsy numbers | 2023-02-07 | Paper |
| A Dombi Counterexample with Positive Lower Density | 2023-02-04 | Paper |
| Proof of a conjecture of Krawchuk and Rampersad | 2023-01-26 | Paper |
| The largest entry in the inverse of a Vandermonde matrix | 2023-01-05 | Paper |
| The computational complexity of some problems of linear algebra | 2022-11-09 | Paper |
| Automatic sequences of rank two | 2022-10-31 | Paper |
| Mesosome avoidance | 2022-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5042381 | 2022-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5042439 | 2022-10-19 | Paper |
| The State Complexity of Lexicographically Smallest Words and Computing Successors | 2022-10-13 | Paper |
| Complement Avoidance in Binary Words | 2022-09-20 | Paper |
| The First-Order Theory of Binary Overlap-Free Words is Decidable | 2022-09-07 | Paper |
| Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton | 2022-09-06 | Paper |
| Characterizing regular languages with polynomial densities | 2022-08-18 | Paper |
| A generalization of automatic sequences | 2022-08-16 | Paper |
| Computational aspects of sturdy and flimsy numbers | 2022-08-10 | Paper |
| Lie complexity of words | 2022-08-10 | Paper |
| The Logical Approach to Automatic Sequences | 2022-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092323 | 2022-07-21 | Paper |
| Properties of a class of Toeplitz words | 2022-06-13 | Paper |
| Synchronized sequences | 2022-05-20 | Paper |
| How to prove that a sequence is not automatic | 2022-04-01 | Paper |
| Frobenius Numbers and Automatic Sequences | 2022-03-24 | Paper |
| Say no to case analysis: automating the drudgery of case-based proofs | 2022-03-22 | Paper |
| Sumsets associated with Beatty sequences | 2022-03-14 | Paper |
| Maximal state complexity and generalized de Bruijn words | 2022-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5061525 | 2022-03-11 | Paper |
| Intertwining of Complementary Thue-Morse Factors | 2022-03-06 | Paper |
| Quotients of Palindromic and Antipalindromic Numbers | 2022-02-28 | Paper |
| Sumsets of Wythoff sequences, Fibonacci representation, and beyond | 2022-02-22 | Paper |
| Decidability and \(k\)-regular sequences | 2022-02-21 | Paper |
| The simplest binary word with only three squares | 2022-01-12 | Paper |
| A Frameless 2-Coloring of the Plane Lattice | 2022-01-11 | Paper |
| Additive Properties of the Evil and Odious Numbers and Similar Sequences | 2021-12-27 | Paper |
| Extending Dekking's construction of an infinite binary word avoiding abelian $4$-powers | 2021-11-15 | Paper |
| Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton | 2021-10-12 | Paper |
| Automatic sequences are also non-uniformly morphic | 2021-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005118 | 2021-08-04 | Paper |
| On some conjectures of P. Barry | 2021-08-02 | Paper |
| Mesosome Avoidance | 2021-07-29 | Paper |
| Rollercoasters and Caterpillars | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994947 | 2021-06-22 | Paper |
| Abelian Complexity and Synchronization | 2021-05-03 | Paper |
| Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture | 2021-04-23 | Paper |
| Additive Number Theory via Approximation by Regular Languages | 2021-04-19 | Paper |
| Robbins and Ardila meet Berstel | 2021-03-11 | Paper |
| Lie complexity of words | 2021-02-07 | Paper |
| Length of the continued logarithm algorithm on rational inputs | 2021-02-05 | Paper |
| Borders, palindrome prefixes, and square prefixes | 2021-02-04 | Paper |
| Ostrowski-automatic sequences: theory and applications | 2021-02-03 | Paper |
| Extremal overlap-free and extremal \(\beta\)-free binary words | 2020-12-13 | Paper |
| String Attractors for Automatic Sequences | 2020-12-12 | Paper |
| Avoidance of split overlaps | 2020-12-04 | Paper |
| Lengths of words accepted by nondeterministic finite automata | 2020-10-07 | Paper |
| New bounds on antipowers in words | 2020-10-07 | Paper |
| Robbins and Ardila meet Berstel | 2020-07-29 | Paper |
| Sum-free sets generated by the period-\(k\)-folding sequences and some Sturmian sequences | 2020-07-08 | Paper |
| Sumsets of Wythoff Sequences, Fibonacci Representation, and Beyond | 2020-06-07 | Paper |
| Decidability and k-Regular Sequences | 2020-05-19 | Paper |
| Generalized de Bruijn words and the state complexity of conjugate sets | 2020-05-12 | Paper |
| Queens in exile: non-attacking queens on infinite chess boards | 2020-03-30 | Paper |
| Waring's theorem for binary powers | 2020-02-26 | Paper |
| Computational Aspects of Sturdy and Flimsy Numbers | 2020-02-07 | Paper |
| Unique decipherability in formal languages | 2019-12-27 | Paper |
| Cobham’s Theorem and Automaticity | 2019-12-19 | Paper |
| Numeration systems, linear recurrences, and regular sets | 2019-12-04 | Paper |
| Words With Few Palindromes, Revisited | 2019-11-27 | Paper |
| Words Avoiding Reversed Factors, Revisited | 2019-11-26 | Paper |
| The Generalized Nagell–Ljunggren Problem: Powers with Repetitive Representations | 2019-11-25 | Paper |
| Natural exact covering systems and the reversion of the Möbius series | 2019-11-19 | Paper |
| Critical exponent of infinite balanced words via the Pell number system | 2019-11-06 | Paper |
| Repetitions in infinite palindrome-rich words | 2019-11-06 | Paper |
| Circularly squarefree words and unbordered conjugates: a new approach | 2019-11-06 | Paper |
| New results on pseudosquare avoidance | 2019-11-06 | Paper |
| Subword complexity and power avoidance | 2019-10-07 | Paper |
| Rollercoasters: Long Sequences without Short Runs | 2019-08-29 | Paper |
| A Class of Exponential Sequences with Shift-Invariant Discriminators | 2019-08-28 | Paper |
| Circular critical exponents for Thue–Morse factors | 2019-07-18 | Paper |
| Critical exponents of infinite balanced words | 2019-06-18 | Paper |
| More infinite products: Thue-Morse and the gamma function | 2019-06-18 | Paper |
| Michel Mendès France, 1936--2018 | 2019-06-05 | Paper |
| The number of valid factorizations of Fibonacci prefixes | 2019-05-29 | Paper |
| Continuants, run lengths, and Barry's modified Pascal triangle | 2019-03-15 | Paper |
| Maximal State Complexity and Generalized de Bruijn Words | 2019-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4557407 | 2018-11-23 | Paper |
| Additive number theory via approximation by regular languages | 2018-11-22 | Paper |
| Counting subwords and regular languages | 2018-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584890 | 2018-09-04 | Paper |
| When is an automatic set an additive basis? | 2018-08-03 | Paper |
| Fractional coverings, greedy coverings, and rectifier networks | 2018-04-19 | Paper |
| Notes and note pairs in Nørgård's infinity series | 2018-03-16 | Paper |
| Common factors in automatic and Sturmian sequences | 2018-02-01 | Paper |
| Periods and borders of random words | 2018-01-24 | Paper |
| Overpals, underlaps, and underpals | 2017-11-15 | Paper |
| Lagrange's Theorem for Binary Squares | 2017-10-11 | Paper |
| Repetitions in words | 2017-10-06 | Paper |
| Abelian-square-rich words | 2017-06-15 | Paper |
| Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties | 2017-04-06 | Paper |
| Enumeration and Automatic Sequences | 2017-03-31 | Paper |
| Hankel matrices for the period-doubling sequence | 2017-01-18 | Paper |
| Discriminators and k-Regular Sequences | 2017-01-03 | Paper |
| Minimum Critical Exponents for Palindromes | 2016-12-15 | Paper |
| Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability | 2016-12-05 | Paper |
| Periodicity in rectangular arrays | 2016-11-23 | Paper |
| Palindromic rich words and run-length encodings | 2016-08-16 | Paper |
| Decision algorithms for Fibonacci-automatic Words, I: Basic results | 2016-08-12 | Paper |
| Remarks on Privileged Words | 2016-08-08 | Paper |
| Minimal Elements for the Prime Numbers | 2016-06-29 | Paper |
| On the Parity of the Number of Small Divisors of n | 2016-04-18 | Paper |
| Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words | 2016-04-15 | Paper |
| An unusual continued fraction | 2016-03-08 | Paper |
| Fife's Theorem for (7/3)-Powers | 2016-03-01 | Paper |
| The Critical Exponent is Computable for Automatic Sequences | 2016-03-01 | Paper |
| Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences | 2016-02-11 | Paper |
| Factorization in Formal Languages | 2015-11-10 | Paper |
| Mechanical Proofs of Properties of the Tribonacci Word | 2015-11-04 | Paper |
| A New Approach to the Paperfolding Sequences | 2015-10-20 | Paper |
| Automatic Sets of Rational Numbers | 2015-09-29 | Paper |
| Three Series for the Generalized Golden Mean | 2015-03-19 | Paper |
| Avoiding Three Consecutive Blocks of the Same Size and Same Sum | 2014-09-12 | Paper |
| Counting the palstars | 2014-09-04 | Paper |
| Neverending Fractions | 2014-07-09 | Paper |
| Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance | 2014-06-03 | Paper |
| AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS | 2014-03-10 | Paper |
| Composition and orbits of language operations: finiteness and upper bounds | 2013-10-22 | Paper |
| Sets Represented as the Length-n Factors of a Word | 2013-09-20 | Paper |
| Shortest Repetition-Free Words Accepted by Automata | 2013-08-09 | Paper |
| The Critical Exponent is Computable for Automatic Sequences | 2013-07-30 | Paper |
| Description of Generalized Continued Fractions by Finite Automata | 2013-07-23 | Paper |
| Subword Complexity and k-Synchronization | 2013-06-28 | Paper |
| Repetition Avoidance in Circular Factors | 2013-06-28 | Paper |
| Filtrations of Formal Languages by Arithmetic Progressions | 2013-06-27 | Paper |
| Counting Sequences with Small Discrepancies | 2013-06-24 | Paper |
| Decidability and Enumeration for Automatic Sequences: A Survey | 2013-06-14 | Paper |
| A VARIANT OF HOFSTADTER’S SEQUENCE AND FINITE AUTOMATA | 2013-06-13 | Paper |
| Inverse star, borders, and palstars | 2013-03-28 | Paper |
| The Frobenius Problem in a Free Monoid | 2013-03-19 | Paper |
| On the Number of Unbordered Factors | 2013-03-18 | Paper |
| Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences | 2013-03-18 | Paper |
| ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES | 2013-01-18 | Paper |
| The State Complexity of Star-Complement-Star | 2012-11-02 | Paper |
| Automatic Theorem-Proving in Combinatorics on Words | 2012-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2893312 | 2012-06-20 | Paper |
| k-Automatic Sets of Rational Numbers | 2012-06-08 | Paper |
| Sturmian graphs and integer representations over numeration systems | 2012-05-04 | Paper |
| Enumerating regular expressions and their languages | 2012-04-23 | Paper |
| A pattern sequence approach to Stern's sequence | 2012-04-13 | Paper |
| Avoiding 3/2-powers over the natural numbers | 2012-04-13 | Paper |
| Kuratowski's Theorem for Two Closure Operators | 2011-09-06 | Paper |
| Enumeration and Decidable Properties of Automatic Sequences | 2011-07-29 | Paper |
| Fife’s Theorem Revisited | 2011-07-29 | Paper |
| Decidability and Shortest Strings in Formal Languages | 2011-07-29 | Paper |
| Remarks on Separating Words | 2011-07-29 | Paper |
| Decision problems for convex languages | 2011-07-27 | Paper |
| Morphic and automatic words: maximal blocks and Diophantine approximation | 2011-06-15 | Paper |
| Finite Orbits of Language Operations | 2011-06-03 | Paper |
| Thue-Morse at multiples of an integer | 2011-05-23 | Paper |
| CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM | 2011-03-30 | Paper |
| Unbounded Discrepancy in Frobenius Numbers | 2011-03-09 | Paper |
| Van der Waerden's Theorem and Avoidability in Words | 2011-03-09 | Paper |
| On Lazy Representations and Sturmian Graphs | 2011-02-11 | Paper |
| FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME | 2010-09-06 | Paper |
| Detecting patterns in finite regular and context-free languages | 2010-09-02 | Paper |
| Counting abelian squares | 2010-03-26 | Paper |
| Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin–Shapiro sequences | 2010-01-14 | Paper |
| Avoiding squares and overlaps over the natural numbers | 2009-12-15 | Paper |
| Hamming distance for conjugates | 2009-12-09 | Paper |
| On NFAs where all states are final, initial, or both | 2009-11-06 | Paper |
| Efficient enumeration of words in regular languages | 2009-09-14 | Paper |
| Periodicity, repetitions, and orbits of an automatic sequence | 2009-08-07 | Paper |
| Closures in Formal Languages and Kuratowski’s Theorem | 2009-07-07 | Paper |
| Decimations of languages and state complexity | 2009-06-04 | Paper |
| State complexity of unique rational operations | 2009-06-04 | Paper |
| Decision Problems for Convex Languages | 2009-04-02 | Paper |
| A Second Course in Formal Languages and Automata Theory | 2008-12-23 | Paper |
| AVOIDING APPROXIMATE SQUARES | 2008-11-24 | Paper |
| The Frobenius Problem and Its Generalizations | 2008-10-30 | Paper |
| Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time | 2008-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517096 | 2008-08-12 | Paper |
| Efficient Enumeration of Regular Languages | 2008-06-10 | Paper |
| Words avoiding repetitions in arithmetic progressions | 2008-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5437181 | 2008-01-18 | Paper |
| Avoiding Approximate Squares | 2007-11-28 | Paper |
| Every real number greater than 1 is a critical exponent | 2007-09-03 | Paper |
| Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms | 2007-08-01 | Paper |
| On Sturmian graphs | 2007-05-30 | Paper |
| Binary words containing infinitely many overlaps | 2007-03-12 | Paper |
| Summation of series defined by counting blocks of digits | 2007-02-26 | Paper |
| Squares and overlaps in the Thue-Morse sequence and some variants | 2007-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3413855 | 2006-12-18 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| A generalization of repetition threshold | 2005-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5710443 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5704331 | 2005-11-14 | Paper |
| NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs | 2005-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5313790 | 2005-09-01 | Paper |
| A generalization of repetition threshold | 2005-08-22 | Paper |
| Avoiding large squares in infinite binary words | 2005-06-30 | Paper |
| Correction to: Linear fractional transformations of continued fractions with bounded partial quotients | 2005-06-30 | Paper |
| UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION | 2005-06-22 | Paper |
| SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS | 2005-06-22 | Paper |
| On integer sequences whose first iterates are linear | 2005-04-29 | Paper |
| Self-generating sets, integers with missing blocks, and substitutions | 2005-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668908 | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737919 | 2004-08-11 | Paper |
| Polynomial versus exponential growth in repetition-free binary words | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4465333 | 2004-05-27 | Paper |
| The ring of \(k\)-regular sequences. II. | 2004-03-14 | Paper |
| On the iteration of certain quadratic maps over GF(\(p\)). | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453455 | 2004-03-07 | Paper |
| Automatic Sequences | 2003-10-19 | Paper |
| Periodicity, morphisms, and matrices. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708964 | 2003-07-09 | Paper |
| Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. | 2003-05-14 | Paper |
| Simulating finite automata with context-free grammars. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779169 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540975 | 2002-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531381 | 2002-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4330617 | 2002-05-14 | Paper |
| On two-sided infinite fixed points of morphisms | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4524327 | 2001-12-05 | Paper |
| Weakly self-avoiding words and a construction of Friedman | 2001-02-19 | Paper |
| On a construction of Friedman | 2000-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503149 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4485869 | 2000-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941509 | 2000-03-12 | Paper |
| Automaticity. III: Polynomial automaticity and context-free languages | 2000-02-12 | Paper |
| The computational complexity of some problems of linear algebra | 2000-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939575 | 2000-02-06 | Paper |
| An inequality for non-negative matrices | 2000-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252166 | 2000-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934356 | 2000-01-17 | Paper |
| Generalized perturbed symmetry | 1999-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252359 | 1999-06-17 | Paper |
| Linear fractional transformations of continued fractions with bounded partial quotients | 1998-11-22 | Paper |
| On minimal words with given subword complexity | 1998-07-27 | Paper |
| Automaticity. II: Descriptional complexity in the unary case | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375814 | 1998-06-11 | Paper |
| Extremal infinite overlap-free binary words | 1998-05-24 | Paper |
| Automaticity. IV: Sequences, sets, and diversity | 1997-11-26 | Paper |
| Automatic maps in exotic numeration systems | 1997-09-07 | Paper |
| AUTOMATIC MAPS ON A SEMIRING WITH DIGITS | 1997-05-28 | Paper |
| Origins of the analysis of the Euclidean algorithm | 1997-03-25 | Paper |
| Automaticity. I: Properties of a measure of descriptional complexity | 1997-03-13 | Paper |
| Subword complexity of a generalized Thue-Morse word | 1997-02-28 | Paper |
| On the vector space of the automatic reals | 1997-02-27 | Paper |
| A lower bound technique for the size of nondeterministic finite automata | 1997-02-27 | Paper |
| Results and estimates on pseudopowers | 1996-12-03 | Paper |
| Convergents of folded continued fractions | 1996-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888749 | 1996-08-19 | Paper |
| Discovery of a lost factoring machine | 1996-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847927 | 1996-06-19 | Paper |
| Complexity of generalized Rudin-Shapiro sequences | 1995-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4323150 | 1995-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325957 | 1995-03-13 | Paper |
| Analysis of a left-shift binary GCD algorithm | 1995-01-22 | Paper |
| Continued Fractions and Linear Recurrences | 1994-10-20 | Paper |
| A Specialised Continued Fraction | 1994-10-20 | Paper |
| Numeration systems, linear recurrences, and regular sets | 1994-10-12 | Paper |
| On sparse languages \(L\) such that \(LL= \Sigma^*\) | 1994-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138894 | 1994-09-19 | Paper |
| Factor Refinement | 1994-04-04 | Paper |
| On the maximum number of distinct factors of a binary string | 1993-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4033748 | 1993-05-16 | Paper |
| Real numbers with bounded partial quotients: A survey | 1993-01-16 | Paper |
| The ring of \(k\)-regular sequences | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4005194 | 1992-09-27 | Paper |
| Pattern spectra, substring enumeration, and automatic sequences | 1992-09-26 | Paper |
| Folded continued fractions | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975928 | 1992-06-26 | Paper |
| Continued fractions for some alternating series | 1991-01-01 | Paper |
| New bounds on the length of finite pierce and Engel series | 1991-01-01 | Paper |
| On the worst case of three algorithms for computing the Jacobi symbol | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3495411 | 1990-01-01 | Paper |
| Wire bending | 1989-01-01 | Paper |
| Infinite Products Associated with Counting Blocks in Binary Strings | 1989-01-01 | Paper |
| Factoring with Cyclotomic Polynomials | 1989-01-01 | Paper |
| Analysis of an Infinite Product Algorithm | 1989-01-01 | Paper |
| A generalization of automatic sequences | 1988-01-01 | Paper |
| Sur des points fixes de morphismes d'un monoïde libre | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3497129 | 1988-01-01 | Paper |
| De nouveaux curieux produits infinis | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731711 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3744217 | 1986-01-01 | Paper |
| Sums of Divisors, Perfect Numbers and Factoring | 1986-01-01 | Paper |
| Randomized algorithms in number theory | 1986-01-01 | Paper |
| On infinite products associated with sums of digits | 1985-01-01 | Paper |
| Number-theoretic functions which are equivalent to number of divisors | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3337530 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3338317 | 1984-01-01 | Paper |
| On the Number of Multiplicative Partitions | 1983-01-01 | Paper |
| Simple continued fractions for some irrational numbers. II | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3926668 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3661656 | 1980-01-01 | Paper |
| Simple continued fractions for some irrational numbers | 1979-01-01 | Paper |
| Predictable regular continued cotangent expansions | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4047623 | 1975-01-01 | Paper |
| An Interesting Continued Fraction | 1975-01-01 | Paper |
| Antisquares and Critical Exponents | N/A | Paper |
| Pseudoperiodic Words and a Question of Shevelev | N/A | Paper |
| Some Fibonacci-Related Sequences | N/A | Paper |
| Combinatorics on words and generating Dirichlet series of automatic sequences | N/A | Paper |
| Strongly k-recursive sequences | N/A | Paper |
| Beatty Sequences for a Quadratic Irrational: Decidability and Applications | N/A | Paper |
| Consecutive Power Occurrences in Sturmian Words | N/A | Paper |
| Using finite automata to compute the base-$b$ representation of the golden ratio and other quadratic irrationals | N/A | Paper |
