| Publication | Date of Publication | Type |
|---|
Computing the base-\(b\) representation of quadratic irrationals using automata
Theoretical Computer Science | 2026-03-26 | Paper |
Christoffel matrices and Sturmian determinants
RAIRO. Theoretical Informatics and Applications | 2026-03-14 | Paper |
Proving properties of \(\varphi\)-representations with the Walnut Theorem-Prover
Communications in Mathematics | 2026-03-09 | Paper |
| 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
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
Consecutive power occurrences in Sturmian words
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2024-11-06 | Paper |
The first-order theory of binary overlap-free words is decidable
Canadian Journal of Mathematics | 2024-10-22 | Paper |
Dyck words, pattern avoidance, and automatic sequences
Communications in Mathematics | 2024-10-08 | Paper |
Pseudoperiodic words and a question of Shevelev
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
Antisquares and critical exponents
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
Decidability for Sturmian words
Logical Methods in Computer Science | 2024-09-04 | Paper |
Power-free complementary binary morphisms
Journal of Combinatorial Theory. Series A | 2024-07-03 | Paper |
Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence
Integers | 2024-05-30 | Paper |
| Using automata and a decision procedure to prove results in pattern matching (invited talk) | 2024-05-06 | Paper |
Decidability for Sturmian words
(available as arXiv preprint) | 2024-04-10 | Paper |
A General Approach to Proving Properties of Fibonacci Representations via Automata Theory
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
Proving results about OEIS sequences with \texttt{Walnut}
Lecture Notes in Computer Science | 2024-02-28 | Paper |
Transduction of automatic sequences and applications
Implementation and Application of Automata | 2024-02-28 | Paper |
Record-setters in the Stern sequence
Discrete Mathematics | 2024-02-19 | Paper |
Proving properties of some greedily-defined Integer recurrences via automata theory
Theoretical Computer Science | 2024-02-09 | Paper |
Rarefied Thue-Morse sums via automata theory and logic
Journal of Number Theory | 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 |
Some tribonacci conjectures
(available as arXiv preprint) | 2023-09-06 | Paper |
| Some tribonacci conjectures | 2023-09-06 | Paper |
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
An Inequality for the Number of Periods in a Word
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Smallest and Largest Block Palindrome Factorizations
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Dyck Words, Pattern Avoidance, and Automatic Sequences
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Rudin-Shapiro Sums via Automata Theory and Logic
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Note on a Fibonacci parity sequence
Cryptography and Communications | 2023-06-20 | Paper |
Counterexamples to a conjecture of Dombi in additive number theory
Acta Mathematica Hungarica | 2023-06-05 | Paper |
Properties of a ternary infinite word
RAIRO - Theoretical Informatics and Applications | 2023-05-25 | Paper |
Automatic sequences in negative bases and proofs of some conjectures of shevelev
RAIRO - Theoretical Informatics and Applications | 2023-05-25 | Paper |
Badly approximable numbers, Kronecker's theorem, and diversity of Sturmian characteristic sequences
Journal de Théorie des Nombres de Bordeaux | 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 |
| Computational fun with sturdy and flimsy numbers | 2023-02-07 | Paper |
Existential length universality
(available as arXiv preprint) | 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
Linear and Multilinear Algebra | 2023-01-05 | Paper |
The computational complexity of some problems of linear algebra (extended abstract)
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Automatic sequences of rank two
RAIRO - Theoretical Informatics and Applications | 2022-10-31 | Paper |
Mesosome avoidance
Information Processing Letters | 2022-10-28 | Paper |
| Intertwining of complementary Thue-Morse factors | 2022-10-19 | Paper |
Intertwining of complementary Thue-Morse factors
(available as arXiv preprint) | 2022-10-19 | Paper |
| Quotients of palindromic and antipalindromic numbers | 2022-10-19 | Paper |
Quotients of palindromic and antipalindromic numbers
(available as arXiv preprint) | 2022-10-19 | Paper |
The State Complexity of Lexicographically Smallest Words and Computing Successors
Developments in Language Theory | 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
The Electronic Journal of Combinatorics | 2022-09-06 | Paper |
Characterizing regular languages with polynomial densities
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
A generalization of automatic sequences
STACS 89 | 2022-08-16 | Paper |
Computational aspects of sturdy and flimsy numbers
Theoretical Computer Science | 2022-08-10 | Paper |
Lie complexity of words
Theoretical Computer Science | 2022-08-10 | Paper |
| The Logical Approach to Automatic Sequences | 2022-08-01 | Paper |
scientific article; zbMATH DE number 7561614 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Properties of a class of Toeplitz words
Theoretical Computer Science | 2022-06-13 | Paper |
| Synchronized sequences | 2022-05-20 | Paper |
How to prove that a sequence is not automatic
Expositiones Mathematicae | 2022-04-01 | Paper |
| Frobenius numbers and automatic sequences | 2022-03-24 | Paper |
Frobenius numbers and automatic sequences
(available as arXiv preprint) | 2022-03-24 | Paper |
| Say no to case analysis: automating the drudgery of case-based proofs | 2022-03-22 | Paper |
Maximal state complexity and generalized de Bruijn words
Information and Computation | 2022-03-14 | Paper |
Sumsets associated with Beatty sequences
Discrete Mathematics | 2022-03-14 | Paper |
| Automata, palindromes, and reversed subwords | 2022-03-11 | Paper |
Intertwining of Complementary Thue-Morse Factors
(available as arXiv preprint) | 2022-03-06 | Paper |
Quotients of Palindromic and Antipalindromic Numbers
(available as arXiv preprint) | 2022-02-28 | Paper |
Sumsets of Wythoff sequences, Fibonacci representation, and beyond
Periodica Mathematica Hungarica | 2022-02-22 | Paper |
Decidability and \(k\)-regular sequences
Theoretical Computer Science | 2022-02-21 | Paper |
The simplest binary word with only three squares
RAIRO - Theoretical Informatics and Applications | 2022-01-12 | Paper |
A Frameless 2-Coloring of the Plane Lattice
Mathematics Magazine | 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
(available as arXiv preprint) | 2021-10-12 | Paper |
Automatic sequences are also non-uniformly morphic
(available as arXiv preprint) | 2021-10-04 | Paper |
Lagrange's theorem for binary squares
(available as arXiv preprint) | 2021-08-04 | Paper |
On some conjectures of P. Barry
Journal of Number Theory | 2021-08-02 | Paper |
Mesosome Avoidance
(available as arXiv preprint) | 2021-07-29 | Paper |
Rollercoasters and caterpillars
(available as arXiv preprint) | 2021-07-28 | Paper |
| Similarity density of the Thue-Morse word with overlap-free infinite binary words | 2021-06-22 | Paper |
Similarity density of the Thue-Morse word with overlap-free infinite binary words
(available as arXiv preprint) | 2021-06-22 | Paper |
| Abelian complexity and synchronization | 2021-05-03 | Paper |
Abelian complexity and synchronization
(available as arXiv preprint) | 2021-05-03 | Paper |
Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
Indagationes Mathematicae. New Series | 2021-04-23 | Paper |
Additive Number Theory via Approximation by Regular Languages
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Robbins and Ardila meet Berstel
Information Processing Letters | 2021-03-11 | Paper |
Lie complexity of words
(available as arXiv preprint) | 2021-02-07 | Paper |
| Length of the continued logarithm algorithm on rational inputs | 2021-02-05 | Paper |
Length of the continued logarithm algorithm on rational inputs
(available as arXiv preprint) | 2021-02-05 | Paper |
Borders, palindrome prefixes, and square prefixes
Information Processing Letters | 2021-02-04 | Paper |
Ostrowski-automatic sequences: theory and applications
Theoretical Computer Science | 2021-02-03 | Paper |
Extremal overlap-free and extremal \(\beta\)-free binary words
The Electronic Journal of Combinatorics | 2020-12-13 | Paper |
| String Attractors for Automatic Sequences | 2020-12-12 | Paper |
Avoidance of split overlaps
Discrete Mathematics | 2020-12-04 | Paper |
New bounds on antipowers in words
Information Processing Letters | 2020-10-07 | Paper |
Lengths of words accepted by nondeterministic finite automata
Information Processing Letters | 2020-10-07 | Paper |
Robbins and Ardila meet Berstel
(available as arXiv preprint) | 2020-07-29 | Paper |
Sum-free sets generated by the period-\(k\)-folding sequences and some Sturmian sequences
Discrete Mathematics | 2020-07-08 | Paper |
Sumsets of Wythoff Sequences, Fibonacci Representation, and Beyond
(available as arXiv preprint) | 2020-06-07 | Paper |
Decidability and k-Regular Sequences
(available as arXiv preprint) | 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
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Queens in exile: non-attacking queens on infinite chess boards
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Waring's theorem for binary powers
Combinatorica | 2020-02-26 | Paper |
Computational Aspects of Sturdy and Flimsy Numbers
(available as arXiv preprint) | 2020-02-07 | Paper |
Unique decipherability in formal languages
Theoretical Computer Science | 2019-12-27 | Paper |
Cobham’s Theorem and Automaticity
International Journal of Foundations of Computer Science | 2019-12-19 | Paper |
Numeration systems, linear recurrences, and regular sets
Automata, Languages and Programming | 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
Experimental Mathematics | 2019-11-25 | Paper |
Natural exact covering systems and the reversion of the Möbius series
The Ramanujan Journal | 2019-11-19 | Paper |
Repetitions in infinite palindrome-rich words
(available as arXiv preprint) | 2019-11-06 | Paper |
New results on pseudosquare avoidance
(available as arXiv preprint) | 2019-11-06 | Paper |
Circularly squarefree words and unbordered conjugates: a new approach
(available as arXiv preprint) | 2019-11-06 | Paper |
Critical exponent of infinite balanced words via the Pell number system
(available as arXiv preprint) | 2019-11-06 | Paper |
Subword complexity and power avoidance
Theoretical Computer Science | 2019-10-07 | Paper |
Rollercoasters: Long Sequences without Short Runs
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
A class of exponential sequences with shift-invariant discriminators
(available as arXiv preprint) | 2019-08-28 | Paper |
| A class of exponential sequences with shift-invariant discriminators | 2019-08-28 | Paper |
Circular critical exponents for Thue-Morse factors
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Critical exponents of infinite balanced words
Theoretical Computer Science | 2019-06-18 | Paper |
Critical exponents of infinite balanced words
Theoretical Computer Science | 2019-06-18 | Paper |
More infinite products: Thue-Morse and the gamma function
The Ramanujan Journal | 2019-06-18 | Paper |
Michel Mendès France, 1936--2018
European Mathematical Society Newsletter | 2019-06-05 | Paper |
The number of valid factorizations of Fibonacci prefixes
Theoretical Computer Science | 2019-05-29 | Paper |
Continuants, run lengths, and Barry's modified Pascal triangle
The Electronic Journal of Combinatorics | 2019-03-15 | Paper |
Continuants, run lengths, and Barry's modified Pascal triangle
The Electronic Journal of Combinatorics | 2019-03-15 | Paper |
Maximal State Complexity and Generalized de Bruijn Words
(available as arXiv preprint) | 2019-03-13 | Paper |
| scientific article; zbMATH DE number 6984429 (Why is no real title available?) | 2018-11-23 | Paper |
Counting subwords and regular languages
(available as arXiv preprint) | 2018-11-22 | Paper |
Additive number theory via approximation by regular languages
(available as arXiv preprint) | 2018-11-22 | Paper |
| Shuffling and unshuffling | 2018-09-04 | Paper |
When is an automatic set an additive basis?
Proceedings of the American Mathematical Society, Series B | 2018-08-03 | Paper |
Fractional coverings, greedy coverings, and rectifier networks
(available as arXiv preprint) | 2018-04-19 | Paper |
Notes and note pairs in Nørgård's infinity series
Journal of Mathematics and Music | 2018-03-16 | Paper |
| Common factors in automatic and Sturmian sequences | 2018-02-01 | Paper |
Periods and borders of random words
(available as arXiv preprint) | 2018-01-24 | Paper |
| Overpals, underlaps, and underpals | 2017-11-15 | Paper |
Lagrange's Theorem for Binary Squares
(available as arXiv preprint) | 2017-10-11 | Paper |
Repetitions in words
Combinatorics, Words and Symbolic Dynamics | 2017-10-06 | Paper |
Abelian-square-rich words
Theoretical Computer Science | 2017-06-15 | Paper |
Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
International Journal of Foundations of Computer Science | 2017-04-06 | Paper |
Enumeration and automatic sequences
Pure Mathematics and Applications | 2017-03-31 | Paper |
Hankel matrices for the period-doubling sequence
Indagationes Mathematicae. New Series | 2017-01-18 | Paper |
| Discriminators and \(k\)-regular sequences | 2017-01-03 | Paper |
Discriminators and \(k\)-regular sequences
(available as arXiv preprint) | 2017-01-03 | Paper |
| Minimum Critical Exponents for Palindromes | 2016-12-15 | Paper |
Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
Theoretical Computer Science | 2016-12-05 | Paper |
Periodicity in rectangular arrays
Information Processing Letters | 2016-11-23 | Paper |
Palindromic rich words and run-length encodings
Information Processing Letters | 2016-08-16 | Paper |
Decision algorithms for Fibonacci-automatic words. I: Basic results.
RAIRO - Theoretical Informatics and Applications | 2016-08-12 | Paper |
Remarks on privileged words
International Journal of Foundations of Computer Science | 2016-08-08 | Paper |
Minimal elements for the prime numbers
Experimental Mathematics | 2016-06-29 | Paper |
On the parity of the number of small divisors of \(n\)
Analytic Number Theory | 2016-04-18 | Paper |
Optimal bounds for the similarity density of the Thue-Morse word with overlap-free and \(\frac73\)-power-free infinite binary words
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
An unusual continued fraction
Proceedings of the American Mathematical Society | 2016-03-08 | Paper |
An unusual continued fraction
Proceedings of the American Mathematical Society | 2016-03-08 | Paper |
Fife's theorem for \(\frac 73\)-powers
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
The critical exponent is computable for automatic sequences
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
The Electronic Journal of Combinatorics | 2016-02-11 | Paper |
Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
The Electronic Journal of Combinatorics | 2016-02-11 | Paper |
Factorization in formal languages
Developments in Language Theory | 2015-11-10 | Paper |
Factorization in formal languages
Developments in Language Theory | 2015-11-10 | Paper |
Mechanical proofs of properties of the Tribonacci word
Lecture Notes in Computer Science | 2015-11-04 | Paper |
A new approach to the paperfolding sequences
Evolving Computability | 2015-10-20 | Paper |
Automatic sets of rational numbers
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
| Three series for the generalized golden mean | 2015-03-19 | Paper |
Three series for the generalized golden mean
(available as arXiv preprint) | 2015-03-19 | Paper |
Avoiding three consecutive blocks of the same size and same sum
Journal of the ACM | 2014-09-12 | Paper |
Counting the palstars
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Counting the palstars
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
| Neverending fractions. An introduction to continued 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
International Journal of Foundations of Computer Science | 2014-03-10 | Paper |
Composition and orbits of language operations: finiteness and upper bounds
International Journal of Computer Mathematics | 2013-10-22 | Paper |
Sets represented as the length-\(n\) factors of a word
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Shortest repetition-free words accepted by automata
Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
The critical exponent is computable for automatic sequences
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
Description of Generalized Continued Fractions by Finite Automata
Springer Proceedings in Mathematics & Statistics | 2013-07-23 | Paper |
Subword complexity and \(k\)-synchronization
Developments in Language Theory | 2013-06-28 | Paper |
Repetition avoidance in circular factors
Developments in Language Theory | 2013-06-28 | Paper |
Filtrations of formal languages by arithmetic progressions
Fundamenta Informaticae | 2013-06-27 | Paper |
Counting sequences with small discrepancies
Experimental Mathematics | 2013-06-24 | Paper |
Decidability and Enumeration for Automatic Sequences: A Survey
Computer Science – Theory and Applications | 2013-06-14 | Paper |
A variant of Hofstadter's sequence and finite automata
Journal of the Australian Mathematical Society | 2013-06-13 | Paper |
Inverse star, borders, and palstars
Information Processing Letters | 2013-03-28 | Paper |
| The Frobenius problem in a free monoid | 2013-03-19 | Paper |
The Frobenius problem in a free monoid
(available as arXiv preprint) | 2013-03-19 | Paper |
Primitive words and Lyndon words in automatic and linearly recurrent sequences
Language and Automata Theory and Applications | 2013-03-18 | Paper |
On the number of unbordered factors
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Enumeration and decidable properties of automatic sequences
International Journal of Foundations of Computer Science | 2013-01-18 | Paper |
The state complexity of star-complement-star
Developments in Language Theory | 2012-11-02 | Paper |
Automatic Theorem-Proving in Combinatorics on Words
Implementation and Application of Automata | 2012-09-20 | Paper |
The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
Fundamenta Informaticae | 2012-06-20 | Paper |
\(k\)-automatic sets of rational numbers
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Sturmian graphs and integer representations over numeration systems
Discrete Applied Mathematics | 2012-05-04 | Paper |
Enumerating regular expressions and their languages
(available as arXiv preprint) | 2012-04-23 | Paper |
A pattern sequence approach to Stern's sequence
Discrete Mathematics | 2012-04-13 | Paper |
Avoiding 3/2-powers over the natural numbers
Discrete Mathematics | 2012-04-13 | Paper |
| Kuratowski's Theorem for Two Closure Operators | 2011-09-06 | Paper |
Fife’s Theorem Revisited
Developments in Language Theory | 2011-07-29 | Paper |
Remarks on separating words
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
Enumeration and decidable properties of automatic sequences
Developments in Language Theory | 2011-07-29 | Paper |
Decidability and shortest strings in formal languages
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
Decision problems for convex languages
Information and Computation | 2011-07-27 | Paper |
Morphic and automatic words: maximal blocks and Diophantine approximation
Acta Arithmetica | 2011-06-15 | Paper |
Finite Orbits of Language Operations
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Thue-Morse at multiples of an integer
Journal of Number Theory | 2011-05-23 | Paper |
Closures in formal languages and Kuratowski's theorem
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
Van der Waerden's Theorem and Avoidability in Words
Integers | 2011-03-09 | Paper |
Van der Waerden's Theorem and Avoidability in Words
Integers | 2011-03-09 | Paper |
Van der Waerden's Theorem and Avoidability in Words
Integers | 2011-03-09 | Paper |
Unbounded discrepancy in Frobenius numbers
Integers | 2011-03-09 | Paper |
Unbounded discrepancy in Frobenius numbers
Integers | 2011-03-09 | Paper |
Unbounded discrepancy in Frobenius numbers
Integers | 2011-03-09 | Paper |
On lazy representations and Sturmian graphs
Implementation and Application of Automata | 2011-02-11 | Paper |
Finding the growth rate of a regular or context-free language in polynomial time
International Journal of Foundations of Computer Science | 2010-09-06 | Paper |
Detecting patterns in finite regular and context-free languages
Information Processing Letters | 2010-09-02 | Paper |
Counting abelian squares
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Counting abelian squares
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Counting abelian squares
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin–Shapiro sequences
Acta Arithmetica | 2010-01-14 | Paper |
Avoiding squares and overlaps over the natural numbers
Discrete Mathematics | 2009-12-15 | Paper |
Hamming distance for conjugates
Discrete Mathematics | 2009-12-09 | Paper |
On NFAs where all states are final, initial, or both
Theoretical Computer Science | 2009-11-06 | Paper |
Efficient enumeration of words in regular languages
Theoretical Computer Science | 2009-09-14 | Paper |
Periodicity, repetitions, and orbits of an automatic sequence
Theoretical Computer Science | 2009-08-07 | Paper |
Closures in Formal Languages and Kuratowski’s Theorem
Developments in Language Theory | 2009-07-07 | Paper |
Decimations of languages and state complexity
Theoretical Computer Science | 2009-06-04 | Paper |
State complexity of unique rational operations
Theoretical Computer Science | 2009-06-04 | Paper |
Decision Problems for Convex Languages
Language and Automata Theory and Applications | 2009-04-02 | Paper |
| A Second Course in Formal Languages and Automata Theory | 2008-12-23 | Paper |
AVOIDING APPROXIMATE SQUARES
International Journal of Foundations of Computer Science | 2008-11-24 | Paper |
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
Developments in Language Theory | 2008-10-30 | Paper |
The Frobenius Problem and Its Generalizations
Developments in Language Theory | 2008-10-30 | Paper |
| scientific article; zbMATH DE number 5309909 (Why is no real title available?) | 2008-08-12 | Paper |
Efficient Enumeration of Regular Languages
Implementation and Application of Automata | 2008-06-10 | Paper |
Words avoiding repetitions in arithmetic progressions
Theoretical Computer Science | 2008-03-05 | Paper |
| Regular expressions: new results and open problems | 2008-01-18 | Paper |
Avoiding Approximate Squares
Developments in Language Theory | 2007-11-28 | Paper |
Every real number greater than 1 is a critical exponent
Theoretical Computer Science | 2007-09-03 | Paper |
Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms
Annales de l’institut Fourier | 2007-08-01 | Paper |
Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms
Annales de l’institut Fourier | 2007-08-01 | Paper |
On Sturmian graphs
Discrete Applied Mathematics | 2007-05-30 | Paper |
Binary words containing infinitely many overlaps
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Binary words containing infinitely many overlaps
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Binary words containing infinitely many overlaps
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Summation of series defined by counting blocks of digits
Journal of Number Theory | 2007-02-26 | Paper |
Squares and overlaps in the Thue-Morse sequence and some variants
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
Squares and overlaps in the Thue-Morse sequence and some variants
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
Squares and overlaps in the Thue-Morse sequence and some variants
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
scientific article; zbMATH DE number 5080600 (Why is no real title available?)
(available as arXiv preprint) | 2006-12-18 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
A generalization of repetition threshold
Theoretical Computer Science | 2005-12-06 | Paper |
scientific article; zbMATH DE number 2235059 (Why is no real title available?)
(available as arXiv preprint) | 2005-12-02 | Paper |
NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs
International Journal of Foundations of Computer Science | 2005-11-14 | Paper |
| scientific article; zbMATH DE number 2228552 (Why is no real title available?) | 2005-11-14 | Paper |
| scientific article; zbMATH DE number 2201362 (Why is no real title available?) | 2005-09-01 | Paper |
A generalization of repetition threshold
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Avoiding large squares in infinite binary words
Theoretical Computer Science | 2005-06-30 | Paper |
Correction to: Linear fractional transformations of continued fractions with bounded partial quotients
Journal de Théorie des Nombres de Bordeaux | 2005-06-30 | Paper |
Correction to: Linear fractional transformations of continued fractions with bounded partial quotients
Journal de Théorie des Nombres de Bordeaux | 2005-06-30 | Paper |
UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
On integer sequences whose first iterates are linear
Aequationes Mathematicae | 2005-04-29 | Paper |
Self-generating sets, integers with missing blocks, and substitutions
Discrete Mathematics | 2005-04-28 | Paper |
| scientific article; zbMATH DE number 2156418 (Why is no real title available?) | 2005-04-15 | Paper |
| scientific article; zbMATH DE number 2087235 (Why is no real title available?) | 2004-08-11 | Paper |
Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory. Series A | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2068873 (Why is no real title available?) | 2004-05-27 | Paper |
The ring of \(k\)-regular sequences. II.
Theoretical Computer Science | 2004-03-14 | Paper |
On the iteration of certain quadratic maps over GF(\(p\)).
Discrete Mathematics | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2051164 (Why is no real title available?) | 2004-03-07 | Paper |
| Automatic Sequences | 2003-10-19 | Paper |
Periodicity, morphisms, and matrices.
Theoretical Computer Science | 2003-08-17 | Paper |
| New problems of pattern avoidance | 2003-07-09 | Paper |
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
Simulating finite automata with context-free grammars.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1834673 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1773091 (Why is no real title available?) | 2002-07-28 | Paper |
| scientific article; zbMATH DE number 1747450 (Why is no real title available?) | 2002-05-29 | Paper |
| scientific article; zbMATH DE number 1740032 (Why is no real title available?) | 2002-05-14 | Paper |
On two-sided infinite fixed points of morphisms
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1552120 (Why is no real title available?) | 2001-12-05 | Paper |
Weakly self-avoiding words and a construction of Friedman
The Electronic Journal of Combinatorics | 2001-02-19 | Paper |
Weakly self-avoiding words and a construction of Friedman
The Electronic Journal of Combinatorics | 2001-02-19 | Paper |
| On a construction of Friedman | 2000-09-08 | Paper |
| scientific article; zbMATH DE number 1502108 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1461539 (Why is no real title available?) | 2000-06-20 | Paper |
| scientific article; zbMATH DE number 1413186 (Why is no real title available?) | 2000-03-12 | Paper |
| scientific article; zbMATH DE number 1413186 (Why is no real title available?) | 2000-03-12 | Paper |
Automaticity. III: Polynomial automaticity and context-free languages
Computational Complexity | 2000-02-12 | Paper |
The computational complexity of some problems of linear algebra
Journal of Computer and System Sciences | 2000-02-08 | Paper |
An inequality for non-negative matrices
Linear Algebra and its Applications | 2000-02-06 | Paper |
| scientific article; zbMATH DE number 1400022 (Why is no real title available?) | 2000-02-06 | Paper |
| scientific article; zbMATH DE number 1305297 (Why is no real title available?) | 2000-01-31 | Paper |
| scientific article; zbMATH DE number 1390089 (Why is no real title available?) | 2000-01-17 | Paper |
Generalized perturbed symmetry
European Journal of Combinatorics | 1999-08-23 | Paper |
| scientific article; zbMATH DE number 1305471 (Why is no real title available?) | 1999-06-17 | Paper |
Linear fractional transformations of continued fractions with bounded partial quotients
Journal de Théorie des Nombres de Bordeaux | 1998-11-22 | Paper |
Linear fractional transformations of continued fractions with bounded partial quotients
Journal de Théorie des Nombres de Bordeaux | 1998-11-22 | Paper |
Linear fractional transformations of continued fractions with bounded partial quotients
Journal de Théorie des Nombres de Bordeaux | 1998-11-22 | Paper |
Linear fractional transformations of continued fractions with bounded partial quotients
Journal de Théorie des Nombres de Bordeaux | 1998-11-22 | Paper |
On minimal words with given subword complexity
The Electronic Journal of Combinatorics | 1998-07-27 | Paper |
On minimal words with given subword complexity
The Electronic Journal of Combinatorics | 1998-07-27 | Paper |
Automaticity. II: Descriptional complexity in the unary case
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1114045 (Why is no real title available?) | 1998-06-11 | Paper |
Extremal infinite overlap-free binary words
The Electronic Journal of Combinatorics | 1998-05-24 | Paper |
Extremal infinite overlap-free binary words
The Electronic Journal of Combinatorics | 1998-05-24 | Paper |
Automaticity. IV: Sequences, sets, and diversity
Journal de Théorie des Nombres de Bordeaux | 1997-11-26 | Paper |
Automaticity. IV: Sequences, sets, and diversity
Journal de Théorie des Nombres de Bordeaux | 1997-11-26 | Paper |
Automaticity. IV: Sequences, sets, and diversity
Journal de Théorie des Nombres de Bordeaux | 1997-11-26 | Paper |
Automatic maps in exotic numeration systems
Theory of Computing Systems | 1997-09-07 | Paper |
AUTOMATIC MAPS ON A SEMIRING WITH DIGITS
Fractals | 1997-05-28 | Paper |
Origins of the analysis of the Euclidean algorithm
Historia Mathematica | 1997-03-25 | Paper |
Automaticity. I: Properties of a measure of descriptional complexity
Journal of Computer and System Sciences | 1997-03-13 | Paper |
Subword complexity of a generalized Thue-Morse word
Information Processing Letters | 1997-02-28 | Paper |
On the vector space of the automatic reals
Theoretical Computer Science | 1997-02-27 | Paper |
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters | 1997-02-27 | Paper |
Results and estimates on pseudopowers
Mathematics of Computation | 1996-12-03 | Paper |
Convergents of folded continued fractions
Acta Arithmetica | 1996-10-10 | Paper |
| scientific article; zbMATH DE number 918133 (Why is no real title available?) | 1996-08-19 | Paper |
Discovery of a lost factoring machine
The Mathematical Intelligencer | 1996-07-15 | Paper |
| scientific article; zbMATH DE number 799776 (Why is no real title available?) | 1996-06-19 | Paper |
Complexity of generalized Rudin-Shapiro sequences
Journal de Théorie des Nombres de Bordeaux | 1995-08-08 | Paper |
Complexity of generalized Rudin-Shapiro sequences
Journal de Théorie des Nombres de Bordeaux | 1995-08-08 | Paper |
| scientific article; zbMATH DE number 722341 (Why is no real title available?) | 1995-03-19 | Paper |
| scientific article; zbMATH DE number 733562 (Why is no real title available?) | 1995-03-13 | Paper |
Analysis of a left-shift binary GCD algorithm
Journal of Symbolic Computation | 1995-01-22 | Paper |
| Continued Fractions and Linear Recurrences | 1994-10-20 | Paper |
A Specialised Continued Fraction
Canadian Journal of Mathematics | 1994-10-20 | Paper |
Numeration systems, linear recurrences, and regular sets
Information and Computation | 1994-10-12 | Paper |
On sparse languages \(L\) such that \(LL= \Sigma^*\)
Discrete Applied Mathematics | 1994-09-27 | Paper |
| scientific article; zbMATH DE number 432766 (Why is no real title available?) | 1994-09-19 | Paper |
Factor Refinement
Journal of Algorithms | 1994-04-04 | Paper |
On the maximum number of distinct factors of a binary string
Graphs and Combinatorics | 1993-08-11 | Paper |
| scientific article; zbMATH DE number 166133 (Why is no real title available?) | 1993-05-16 | Paper |
Real numbers with bounded partial quotients: A survey
L'Enseignement Mathématique. 2e Série | 1993-01-16 | Paper |
The ring of \(k\)-regular sequences
Theoretical Computer Science | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 58307 (Why is no real title available?) | 1992-09-27 | Paper |
Pattern spectra, substring enumeration, and automatic sequences
Theoretical Computer Science | 1992-09-26 | Paper |
Folded continued fractions
Journal of Number Theory | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 18525 (Why is no real title available?) | 1992-06-26 | Paper |
Continued fractions for some alternating series
Monatshefte für Mathematik | 1991-01-01 | Paper |
New bounds on the length of finite pierce and Engel series
Journal de Théorie des Nombres de Bordeaux | 1991-01-01 | Paper |
On the worst case of three algorithms for computing the Jacobi symbol
Journal of Symbolic Computation | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4168756 (Why is no real title available?) | 1990-01-01 | Paper |
Infinite Products Associated with Counting Blocks in Binary Strings
Journal of the London Mathematical Society | 1989-01-01 | Paper |
| Factoring with Cyclotomic Polynomials | 1989-01-01 | Paper |
Analysis of an Infinite Product Algorithm
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
Wire bending
Journal of Combinatorial Theory. Series A | 1989-01-01 | Paper |
A generalization of automatic sequences
Theoretical Computer Science | 1988-01-01 | Paper |
Sur des points fixes de morphismes d'un monoïde libre
RAIRO - Theoretical Informatics and Applications | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4170998 (Why is no real title available?) | 1988-01-01 | Paper |
De nouveaux curieux produits infinis
Acta Arithmetica | 1987-01-01 | Paper |
Randomized algorithms in number theory
Communications on Pure and Applied Mathematics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3979140 (Why is no real title available?) | 1986-01-01 | Paper |
Sums of Divisors, Perfect Numbers and Factoring
SIAM Journal on Computing | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3963962 (Why is no real title available?) | 1986-01-01 | Paper |
On infinite products associated with sums of digits
Journal of Number Theory | 1985-01-01 | Paper |
Number-theoretic functions which are equivalent to number of divisors
Information Processing Letters | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3871451 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3869415 (Why is no real title available?) | 1984-01-01 | Paper |
On the Number of Multiplicative Partitions
The American Mathematical Monthly | 1983-01-01 | Paper |
Simple continued fractions for some irrational numbers. II
Journal of Number Theory | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3739652 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3813714 (Why is no real title available?) | 1980-01-01 | Paper |
Simple continued fractions for some irrational numbers
Journal of Number Theory | 1979-01-01 | Paper |
Predictable regular continued cotangent expansions
Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3462025 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3462025 (Why is no real title available?) | 1975-01-01 | Paper |
| An Interesting Continued Fraction | 1975-01-01 | Paper |
Antisquares and Critical Exponents
(available as arXiv preprint) | N/A | Paper |
Pseudoperiodic Words and a Question of Shevelev
(available as arXiv preprint) | N/A | Paper |
Some Fibonacci-Related Sequences
(available as arXiv preprint) | N/A | Paper |
Combinatorics on words and generating Dirichlet series of automatic sequences
(available as arXiv preprint) | N/A | Paper |
Strongly k-recursive sequences
(available as arXiv preprint) | N/A | Paper |
Beatty Sequences for a Quadratic Irrational: Decidability and Applications
(available as arXiv preprint) | N/A | Paper |
Consecutive Power Occurrences in Sturmian Words
(available as arXiv preprint) | N/A | Paper |
Using finite automata to compute the base-$b$ representation of the golden ratio and other quadratic irrationals
(available as arXiv preprint) | N/A | Paper |
