Jeffrey O. Shallit

Discret. Math., April, 2024

Proving properties of some greedily-defined integer recurrences via automata theory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Decidability for Sturmian words.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2024

Power-free complementary binary morphisms.

[BibT_eX]

[DOI]

Stefan Zorcic

J. Comb. Theory, Ser. A, 2024

Christoffel Matrices and Sturmian Determinants.

[BibT_eX]

[DOI]

Christophe Reutenauer

CoRR, 2024

Some Remarks on Palindromic Periodicities.

[BibT_eX]

[DOI]

Gabriele Fici

Jamie Simpson

CoRR, 2024

The Repetition Threshold for Rote Sequences.

[BibT_eX]

[DOI]

Nicolas Ollinger

CoRR, 2024

The reflection complexity of sequences over finite alphabets.

[BibT_eX]

[DOI]

CoRR, 2024

Repetition Threshold for Binary Automatic Sequences.

[BibT_eX]

[DOI]

CoRR, 2024

Consecutive Power Occurrences in Sturmian Words.

[BibT_eX]

[DOI]

Christian Schulz

CoRR, 2024

Beatty Sequences for a Quadratic Irrational: Decidability and Applications.

[BibT_eX]

[DOI]

Stefan Zorcic

CoRR, 2024

Strongly k-recursive sequences.

[BibT_eX]

[DOI]

Daniel Krenn

CoRR, 2024

Combinatorics on words and generating Dirichlet series of automatic sequences.

[BibT_eX]

[DOI]

Manon Stipulanti

CoRR, 2024

State Complexity of the Minimal Star Basis.

[BibT_eX]

[DOI]

Jozef Jirásek

Galina Jirásková

Proceedings of the Implementation and Application of Automata, 2024

Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals.

[BibT_eX]

[DOI]

Aaron Barnoff

Curtis Bright

Proceedings of the Implementation and Application of Automata, 2024

Additive Word Complexity and Walnut.

[BibT_eX]

[DOI]

Pierre Popoli

Manon Stipulanti

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023

Note on a Fibonacci parity sequence.

[BibT_eX]

[DOI]

Cryptogr. Commun., March, 2023

Automatic sequences in negative bases and proofs of some conjectures of shevelev.

[BibT_eX]

[DOI]

Sonja Linghui Shan

Kai-Hsiang Yang

RAIRO Theor. Informatics Appl., 2023

Properties of a ternary infinite word.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2023

Mesosome avoidance.

[BibT_eX]

[DOI]

Robert Cummings

Paul Staadecker

Inf. Process. Lett., 2023

Some Fibonacci-Related Sequences.

[BibT_eX]

[DOI]

Benoit Cloitre

CoRR, 2023

Repetition factorization of automatic sequences.

[BibT_eX]

[DOI]

Xinhao Xu

CoRR, 2023

New constructions for 3-free and 3+-free binary morphisms.

[BibT_eX]

[DOI]

Stefan Zorcic

CoRR, 2023

Proof of Irvine's Conjecture via Mechanized Guessing.

[BibT_eX]

[DOI]

CoRR, 2023

A General Approach to Proving Properties of Fibonacci Representations via Automata Theory.

[BibT_eX]

[DOI]

Sonja Linghui Shan

Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

Proving Properties of φ-Representations with the Walnut Theorem-Prover.

[BibT_eX]

[DOI]

CoRR, 2023

Rarefied Thue-Morse Sums Via Automata Theory and Logic.

[BibT_eX]

[DOI]

CoRR, 2023

Prefixes of the Fibonacci word.

[BibT_eX]

[DOI]

CoRR, 2023

A Dombi Counterexample with Positive Lower Density.

[BibT_eX]

[DOI]

CoRR, 2023

Proof of a conjecture of Krawchuk and Rampersad.

[BibT_eX]

[DOI]

CoRR, 2023

Transduction of Automatic Sequences and Applications.

[BibT_eX]

[DOI]

Anatoly Zavyalov

Proceedings of the Implementation and Application of Automata, 2023

Proving Results About OEIS Sequences with Walnut.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics - 16th International Conference, 2023

Rudin-Shapiro Sums via Automata Theory and Logic.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

Dyck Words, Pattern Avoidance, and Automatic Sequences.

[BibT_eX]

[DOI]

Lucas Mol

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

Smallest and Largest Block Palindrome Factorizations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022

Decidability and k-regular sequences.

[BibT_eX]

[DOI]

Daniel Krenn

Theor. Comput. Sci., 2022

Properties of a class of Toeplitz words.

[BibT_eX]

[DOI]

Gabriele Fici

Theor. Comput. Sci., 2022

Computational aspects of sturdy and flimsy numbers.

[BibT_eX]

[DOI]

Trevor Clokie

Thomas F. Lidbetter

Antonio Molina Lovett

Leon Witzman

Theor. Comput. Sci., 2022

Lie complexity of words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Sumsets of Wythoff sequences, Fibonacci representation, and beyond.

[BibT_eX]

[DOI]

Period. Math. Hung., 2022

Automatic sequences of rank two.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2022

Maximal state complexity and generalized de Bruijn words.

[BibT_eX]

[DOI]

Stepan Holub

Inf. Comput., 2022

Sumsets associated with Beatty sequences.

[BibT_eX]

[DOI]

Phakhinkon Phunphayap

Prapanpong Pongsriiam

Discret. Math., 2022

Counterexamples to a Conjecture of Dombi in Additive Number Theory.

[BibT_eX]

[DOI]

CoRR, 2022

Some Tribonacci Conjectures.

[BibT_eX]

[DOI]

CoRR, 2022

Complement Avoidance in Binary Words.

[BibT_eX]

[DOI]

CoRR, 2022

Antisquares and Critical Exponents.

[BibT_eX]

[DOI]

CoRR, 2022

The First-Order Theory of Binary Overlap-Free Words is Decidable.

[BibT_eX]

[DOI]

CoRR, 2022

Pseudoperiodic Words and a Question of Shevelev.

[BibT_eX]

[DOI]

CoRR, 2022

Intertwining of Complementary Thue-Morse Factors.

[BibT_eX]

[DOI]

CoRR, 2022

Quotients of Palindromic and Antipalindromic Numbers.

[BibT_eX]

[DOI]

CoRR, 2022

Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Ostrowski-automatic sequences: Theory and applications.

[BibT_eX]

[DOI]

Aseem R. Baranwal

Theor. Comput. Sci., 2021

Automata, Palindromes, and Reversed Subwords.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2021

The simplest binary word with only three squares.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2021

Robbins and Ardila meet Berstel.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Borders, palindrome prefixes, and square prefixes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

An Inequality for the Number of Periods in a Word.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

Avoidance of split overlaps.

[BibT_eX]

[DOI]

Xiaofeng Zhong

Discret. Math., 2021

Additive Number Theory via Automata and Logic.

[BibT_eX]

[DOI]

CoRR, 2021

Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers.

[BibT_eX]

[DOI]

CoRR, 2021

Hilbert's spacefilling curve described by automatic, regular, and synchronized sequences.

[BibT_eX]

[DOI]

CoRR, 2021

Frobenius Numbers and Automatic Sequences.

[BibT_eX]

[DOI]

CoRR, 2021

Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2021

Computational Fun with Sturdy and Flimsy Numbers.

[BibT_eX]

[DOI]

Trevor Clokie

Thomas F. Lidbetter

Antonio Molina Lovett

Leon Witzman

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

Synchronized Sequences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

Enumerating regular expressions and their languages.

[BibT_eX]

[DOI]

Hermann Gruber

Jonathan Lee

Proceedings of the Handbook of Automata Theory., 2021

2020

Unique decipherability in formal languages.

[BibT_eX]

[DOI]

Paul C. Bell

Daniel Reidenbach

Theor. Comput. Sci., 2020

Additive Number Theory via Automata Theory.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Lengths of words accepted by nondeterministic finite automata.

[BibT_eX]

[DOI]

Aaron Potechin

Inf. Process. Lett., 2020

New bounds on antipowers in words.

[BibT_eX]

[DOI]

Samin Riasat

Inf. Process. Lett., 2020

Additive Number Theory via Approximation by Regular Languages.

[BibT_eX]

[DOI]

Thomas F. Lidbetter

Int. J. Found. Comput. Sci., 2020

Sum-free sets generated by the period-k-folding sequences and some Sturmian sequences.

[BibT_eX]

[DOI]

Discret. Math., 2020

String Attractors for Automatic Sequences.

[BibT_eX]

[DOI]

CoRR, 2020

Abelian Complexity and Synchronization.

[BibT_eX]

[DOI]

CoRR, 2020

Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture.

[BibT_eX]

[DOI]

CoRR, 2020

The Largest Entry in the Inverse of a Vandermonde Matrix.

[BibT_eX]

[DOI]

Carlo Sanna

Shun Zhang

CoRR, 2020

Extremal overlap-free and extremal β-free binary words.

[BibT_eX]

[DOI]

Lucas Mol

CoRR, 2020

A Frameless 2-Coloring of the Plane Lattice.

[BibT_eX]

[DOI]

Craig S. Kaplan

CoRR, 2020

Decidability and k-Regular Sequences.

[BibT_eX]

[DOI]

Daniel Krenn

CoRR, 2020

Avoidance of split overlaps.

[BibT_eX]

[DOI]

CoRR, 2020

Extremal Overlap-Free and Extremal $\beta$-Free Binary Words.

[BibT_eX]

[DOI]

Lucas Mol

Electron. J. Comb., 2020

Queens in Exile: Non-attacking Queens on Infinite Chess Boards.

[BibT_eX]

[DOI]

F. Michel Dekking

Neil J. A. Sloane

Electron. J. Comb., 2020

Existential Length Universality.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

The State Complexity of Lexicographically Smallest Words and Computing Successors.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019

Subword complexity and power avoidance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Critical exponents of infinite balanced words.

[BibT_eX]

[DOI]

Élise Vandomme

Theor. Comput. Sci., 2019

The number of valid factorizations of Fibonacci prefixes.

[BibT_eX]

[DOI]

Pierre Bonardo

Anna E. Frid

Theor. Comput. Sci., 2019

Rollercoasters: Long Sequences without Short Runs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Circular critical exponents for Thue-Morse factors.

[BibT_eX]

[DOI]

Ramin Zarifi

RAIRO Theor. Informatics Appl., 2019

Cobham's Theorem and Automaticity.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

The Generalized Nagell-Ljunggren Problem: Powers with Repetitive Representations.

[BibT_eX]

[DOI]

Andrew Bridy

Robert J. Lemke Oliver

Arlo Shallit

Exp. Math., 2019

New Bounds on Antipowers in Binary Words.

[BibT_eX]

[DOI]

Samin Riasat

CoRR, 2019

Words With Few Palindromes, Revisited.

[BibT_eX]

[DOI]

CoRR, 2019

Words Avoiding Reversed Factors, Revisited.

[BibT_eX]

[DOI]

CoRR, 2019

Automatic sequences are also non-uniformly morphic.

[BibT_eX]

[DOI]

CoRR, 2019

Continuants, Run Lengths, and Barry's Modified Pascal Triangle.

[BibT_eX]

[DOI]

Lukas Spiegelhofer

Electron. J. Comb., 2019

Waring's Theorem for Binary Powers.

[BibT_eX]

[DOI]

Daniel M. Kane

Carlo Sanna

Comb., 2019

Optimal Regular Expressions for Permutations.

[BibT_eX]

[DOI]

Antonio Molina Lovett

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Generalized de Bruijn Words and the State Complexity of Conjugate Sets.

[BibT_eX]

[DOI]

Stepan Holub

Proceedings of the Descriptional Complexity of Formal Systems, 2019

New Results on Pseudosquare Avoidance.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

Circularly Squarefree Words and Unbordered Conjugates: A New Approach.

[BibT_eX]

[DOI]

Trevor Clokie

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

Repetitions in Infinite Palindrome-Rich Words.

[BibT_eX]

[DOI]

Aseem R. Baranwal

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

Critical Exponent of Infinite Balanced Words via the Pell Number System.

[BibT_eX]

[DOI]

Aseem R. Baranwal

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

Preface.

[BibT_eX]

[DOI]

Alexander Okhotin

Inf. Comput., 2018

Common factors in automatic and Sturmian sequences.

[BibT_eX]

[DOI]

CoRR, 2018

Sums of Palindromes: an Approach via Automata.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Lagrange's Theorem for Binary Squares.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Rollercoasters and Caterpillars.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Counting Subwords and Regular Languages.

[BibT_eX]

[DOI]

Charles J. Colbourn

Ryan E. Dougherty

Thomas Finn Lidbetter

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

Abelian-square-rich words.

[BibT_eX]

[DOI]

Gabriele Fici

Filippo Mignosi

Theor. Comput. Sci., 2017

Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Preface.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

Periodicity in rectangular arrays.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

A Taxonomy of Morphic Sequences.

[BibT_eX]

[DOI]

CoRR, 2017

Disjoint covering systems and the reversion of the Möbius series.

[BibT_eX]

[DOI]

I. P. Goulden

L. Bruce Richmond

CoRR, 2017

When is an automatic set an additive basis?

[BibT_eX]

[DOI]

Kathryn Hare

CoRR, 2017

Sums of Palindromes: an Approach via Nested-Word Automata.

[BibT_eX]

[DOI]

CoRR, 2017

A Class of Exponential Sequences with Shift-Invariant Discriminators.

[BibT_eX]

[DOI]

Sajed Haque

CoRR, 2017

Existential length universality.

[BibT_eX]

[DOI]

CoRR, 2017

Fractional Coverings, Greedy Coverings, and Rectifier Networks.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Undecidability and Finite Automata.

[BibT_eX]

[DOI]

Jörg Endrullis

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

Overpals, Underlaps, and Underpals.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

Decision algorithms for Fibonacci-automatic Words, I: Basic results.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2016

Palindromic rich words and run-length encodings.

[BibT_eX]

[DOI]

Chuan Guo

Inf. Process. Lett., 2016

Discriminators and k-Regular Sequences.

[BibT_eX]

[DOI]

Sajed Haque

Integers, 2016

Remarks on Privileged Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

Minimal Elements for the Prime Numbers.

[BibT_eX]

[DOI]

Curtis Bright

Raymond R. Devillers

Exp. Math., 2016

Periodicity in Rectangular Arrays.

[BibT_eX]

[DOI]

Taylor J. Smith

CoRR, 2016

Minimum Critical Exponents for Palindromes.

[BibT_eX]

[DOI]

CoRR, 2016

Length of the continued logarithm algorithm on rational inputs.

[BibT_eX]

[DOI]

CoRR, 2016

On the subword complexity of the fixed point of $a \rightarrow aab$, $b \rightarrow b$, and generalizations.

[BibT_eX]

[DOI]

CoRR, 2016

Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Periods and Borders of Random Words.

[BibT_eX]

[DOI]

Stepan Holub

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

Automatic Sets of Rational Numbers.

[BibT_eX]

[DOI]

Eric Rowland

Int. J. Found. Comput. Sci., 2015

Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words.

[BibT_eX]

[DOI]

Chen Fei Du

Int. J. Found. Comput. Sci., 2015

Closed, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences.

[BibT_eX]

[DOI]

CoRR, 2015

On the Combinatorics of Palindromes and Antipalindromes.

[BibT_eX]

[DOI]

Chuan Guo

CoRR, 2015

Hankel Matrices for the Period-Doubling Sequence.

[BibT_eX]

[DOI]

Robbert J. Fokkink

Cor Kraaikamp

CoRR, 2015

Factorization in Formal Languages.

[BibT_eX]

[DOI]

Paul C. Bell

Daniel Reidenbach

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Mechanical Proofs of Properties of the Tribonacci Word.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

A New Approach to the Paperfolding Sequences.

[BibT_eX]

[DOI]

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Avoiding Three Consecutive Blocks of the Same Size and Same Sum.

[BibT_eX]

[DOI]

J. ACM, 2014

Reviewing the Early Days of Computing [Book Review].

[BibT_eX]

[DOI]

Comput. Sci. Eng., 2014

Similarity density of the Thue-Morse word with overlap-free infinite binary words.

[BibT_eX]

[DOI]

Chen Fei Du

Christopher Drexler-Lemire

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance.

[BibT_eX]

[DOI]

CoRR, 2014

Notes and Note-Pairs in Noergaard's Infinity Series.

[BibT_eX]

[DOI]

CoRR, 2014

Counting the Palstars.

[BibT_eX]

[DOI]

L. Bruce Richmond

Electron. J. Comb., 2014

2013

Review of computability and complexity theory by Steven Homer and Alan L. Selman.

[BibT_eX]

[DOI]

SIGACT News, 2013

Automatic Theorem-Proving in Combinatorics on Words.

[BibT_eX]

[DOI]

Dane Henshall

Int. J. Found. Comput. Sci., 2013

Composition and orbits of language operations: finiteness and upper bounds.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2013

Filtrations of Formal Languages by Arithmetic Progressions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

Counting Sequences with Small Discrepancies.

[BibT_eX]

[DOI]

Alexander Leong

Exp. Math., 2013

Counting Palstars.

[BibT_eX]

[DOI]

CoRR, 2013

Remarks on Privileged Words.

[BibT_eX]

[DOI]

Michael Forsyth

Amlesh Jayakumar

CoRR, 2013

Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences.

[BibT_eX]

[DOI]

Kalle Saari

Proceedings of the Language and Automata Theory and Applications, 2013

On the Number of Unbordered Factors.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2013

Repetition Avoidance in Circular Factors.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Subword Complexity and k-Synchronization.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Shortest Repetition-Free Words Accepted by Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2013

Sets Represented as the Length-n Factors of a Word.

[BibT_eX]

[DOI]

Shuo Tan

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

Decidability and Enumeration for Automatic Sequences: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2013

Description of Generalized Continued Fractions by Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Number Theory and Related Fields, In Memory of Alf van der Poorten, 2013

2012

Review of biscuits of number theory by Arthur T. Benjamin and Ezra Brown.

[BibT_eX]

[DOI]

SIGACT News, 2012

Review of finite fields and applications by Gary L. Mullen and Carl Mummert.

[BibT_eX]

[DOI]

SIGACT News, 2012

The Critical Exponent is Computable for Automatic Sequences.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Enumeration and Decidable Properties of Automatic Sequences.

[BibT_eX]

[DOI]

Emilie Charlier

Int. J. Found. Comput. Sci., 2012

The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Shuffling and Unshuffling.

[BibT_eX]

[DOI]

Dane Henshall

Bull. EATCS, 2012

Avoiding 3/2-powers over the natural numbers.

[BibT_eX]

[DOI]

Eric Rowland

Discret. Math., 2012

Sturmian graphs and integer representations over numeration systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Least periods of k-automatic sequences

[BibT_eX]

[DOI]

CoRR, 2012

Primitive Words and Lyndon Words in Automatic Sequences

[BibT_eX]

[DOI]

CoRR, 2012

The Subword Complexity of k-Automatic Sequences is k-Synchronized

[BibT_eX]

[DOI]

CoRR, 2012

Enumerating regular expressions and their languages

[BibT_eX]

[DOI]

Hermann Gruber

Jonathan Lee

CoRR, 2012

Automatic Theorem-Proving in Combinatorics on Words

[BibT_eX]

[DOI]

Dane Henshall

CoRR, 2012

k-Automatic Sets of Rational Numbers.

[BibT_eX]

[DOI]

Eric Rowland

Proceedings of the Language and Automata Theory and Applications, 2012

The State Complexity of Star-Complement-Star.

[BibT_eX]

[DOI]

Galina Jirásková

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Information theory, evolutionary computation, and Dembski's "complex specified information".

[BibT_eX]

[DOI]

Wesley R. Elsberry

Synth., 2011

Inverse star, borders, and palstars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Unbounded Discrepancy in Frobenius Numbers.

[BibT_eX]

[DOI]

James Stankewicz

Integers, 2011

Van der Waerden's Theorem and Avoidability in Words.

[BibT_eX]

[DOI]

Yu Hin Au

Aaron Robertson

Integers, 2011

Closures in Formal Languages and Kuratowski's Theorem.

[BibT_eX]

[DOI]

Janusz A. Brzozowski

Elyot Grant

Int. J. Found. Comput. Sci., 2011

Decision problems for convex languages.

[BibT_eX]

[DOI]

Janusz A. Brzozowski

Inf. Comput., 2011

A pattern sequence approach to Stern's sequence.

[BibT_eX]

[DOI]

Michael Coons

Discret. Math., 2011

Shuffling and Unshuffling

[BibT_eX]

[DOI]

CoRR, 2011

Fife's Theorem for (7/3)-Powers

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

The Critical Exponent is Computable for Automatic Sequences

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

A variant of Hofstadter's sequence and finite automata

[BibT_eX]

[DOI]

CoRR, 2011

Finite Orbits of Language Operations.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

Fife's Theorem Revisited.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Remarks on Separating Words.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

Decidability and Shortest Strings in Formal Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010

Cryptographic applications of analytic number theory: lower bounds and pseudorandomness author of book: Igor Shparlinski Birkäuser, 2003.

[BibT_eX]

[DOI]

SIGACT News, 2010

Detecting patterns in finite regular and context-free languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

On Lazy Representations and Sturmian Graphs.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2010

2009

State complexity of unique rational operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Decimations of languages and state complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On NFAs where all states are final, initial, or both.

[BibT_eX]

[DOI]

Jui-Yi Kao

Theor. Comput. Sci., 2009

Periodicity, repetitions, and orbits of an automatic sequence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Efficient enumeration of words in regular languages.

[BibT_eX]

[DOI]

Margareta Ackerman

Theor. Comput. Sci., 2009

Detecting palindromes, patterns and borders in regular languages.

[BibT_eX]

[DOI]

Inf. Comput., 2009

Hamming distance for conjugates.

[BibT_eX]

[DOI]

Discret. Math., 2009

Avoiding squares and overlaps over the natural numbers.

[BibT_eX]

[DOI]

Mathieu Guay-Paquet

Discret. Math., 2009

Automata and Reduced Words in the Free Group

[BibT_eX]

[DOI]

CoRR, 2009

Length of the Shortest Word in the Intersection of Regular Languages

[BibT_eX]

[DOI]

Thomas Ang

CoRR, 2009

Closures in Formal Languages: Concatenation, Separation, and Algorithms

[BibT_eX]

[DOI]

Janusz A. Brzozowski

Elyot Grant

CoRR, 2009

Counting Abelian Squares.

[BibT_eX]

[DOI]

L. Bruce Richmond

Electron. J. Comb., 2009

2008

Words avoiding repetitions in arithmetic progressions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Avoiding Approximate Squares.

[BibT_eX]

[DOI]

Pascal Ochem

Int. J. Found. Comput. Sci., 2008

On NFAs Where All States are Final, Initial, or Both

[BibT_eX]

[DOI]

CoRR, 2008

An NP-hardness Result on the Monoid Frobenius Problem

[BibT_eX]

[DOI]

CoRR, 2008

Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences.

[BibT_eX]

[DOI]

Elyot Grant

Thomas Stoll

CoRR, 2008

Morphic and Automatic Words: Maximal Blocks and Diophantine Approximation.

[BibT_eX]

[DOI]

Yann Bugeaud

Dalia Krieger

CoRR, 2008

The Frobenius Problem in a Free Monoid.

[BibT_eX]

[DOI]

Jui-Yi Kao

Proceedings of the STACS 2008, 2008

Finite Automata, Palindromes, Powers, and Patterns.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

The Frobenius Problem and Its Generalizations.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

A Second Course in Formal Languages and Automata Theory.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-521-86572-2, 2008

2007

Every real number greater than 1 is a critical exponent.

[BibT_eX]

[DOI]

Dalia Krieger

Theor. Comput. Sci., 2007

Enumeration of Context-Free Languages and Related Structures.

[BibT_eX]

[DOI]

Alexander Okhotin

J. Autom. Lang. Comb., 2007

On Sturmian graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Finding the growth rate of a regular language in polynomial time

[BibT_eX]

[DOI]

Dalia Krieger

CoRR, 2007

Finite automata, palindromes, patterns, and borders

[BibT_eX]

[DOI]

CoRR, 2007

Efficient Enumeration of Regular Languages.

[BibT_eX]

[DOI]

Margareta Ackerman

Proceedings of the Implementation and Application of Automata, 2007

Avoiding Approximate Squares.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Squares and overlaps in the Thue-Morse sequence and some variants.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

Binary Words Containing Infinitely Many Overlaps.

[BibT_eX]

[DOI]

James D. Currie

Electron. J. Comb., 2006

New Directions in State Complexity.

[BibT_eX]

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005

Avoiding large squares in infinite binary words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A generalization of repetition threshold.

[BibT_eX]

[DOI]

Lucian Ilie

Pascal Ochem

Theor. Comput. Sci., 2005

Regular Expressions: New Results and Open Problems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

State complexity and the monoid of transformations of a finite set.

[BibT_eX]

[DOI]

Bryan Krawetz

John Lawrence

Int. J. Found. Comput. Sci., 2005

Non-uniqueness and radius of cyclic unary NFAs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Self-generating sets, integers with missing blocks, and substitutions.

[BibT_eX]

[DOI]

Guentcho Skordev

Discret. Math., 2005

2004

Polynomial versus exponential growth in repetition-free binary words.

[BibT_eX]

[DOI]

Juhani Karhumäki

J. Comb. Theory A, 2004

Simultaneous Avoidance Of Large Squares And Fractional Powers In Infinite Binary Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2004

On the iteration of certain quadratic maps over GF(p).

[BibT_eX]

[DOI]

Troy Vasiga

Discret. Math., 2004

Enumerating Regular Expressions and Their Languages.

[BibT_eX]

[DOI]

Jonathan Lee

Proceedings of the Implementation and Application of Automata, 2004

Sturmian Graphs and a Conjecture of Moser.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

2003

Periodicity, morphisms, and matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

The ring of k-regular sequences, II.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A Generalization of Repetition Threshold

[BibT_eX]

[DOI]

Lucian Ilie

CoRR, 2003

Cubefree binary words avoiding long squares

[BibT_eX]

[DOI]

CoRR, 2003

Automatic Sequences - Theory, Applications, Generalizations.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-521-82332-6, 2003

2002

On two-sided infinite fixed points of morphisms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

The computational complexity of the local postage stamp problem.

[BibT_eX]

[DOI]

SIGACT News, 2002

Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds.

[BibT_eX]

[DOI]

Giovanni Pighizzini

J. Comput. Syst. Sci., 2002

On the Number of Distinct Languages Accepted by Finite Automata with n States.

[BibT_eX]

[DOI]

Derek Kisman

J. Autom. Lang. Comb., 2002

Simulating finite automata with context-free grammars.

[BibT_eX]

[DOI]

Giovanni Pighizzini

Inf. Process. Lett., 2002

Unary Language Operations, State Complexity and Jacobsthal's Function.

[BibT_eX]

[DOI]

Giovanni Pighizzini

Int. J. Found. Comput. Sci., 2002

The Cycles of the Multiway Perfect Shuffle Permutation.

[BibT_eX]

[DOI]

John A. Ellis

Hongbing Fan

Discret. Math. Theor. Comput. Sci., 2002

Regular Expressions: New Results and Open Problems.

[BibT_eX]

Keith Ellul

Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001

Automatic Complexity of Strings.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2001

Weakly Self-Avoiding Words and a Construction of Friedman.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

Variations on a Theorem of Fine & Wilf.

[BibT_eX]

[DOI]

Filippo Mignosi

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Minimal Covers of Formal Languages.

[BibT_eX]

[DOI]

Sheng Yu

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000

A Recurrence Generating Multiples of Primes: 10655.

[BibT_eX]

[DOI]

Am. Math. Mon., 2000

Automaticity and Rationality.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2000

Sums of Digits, Overlaps, and Palindromes.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2000

State Complexity and Jacobsthal's Function.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2000

Formal languages and number theory.

[BibT_eX]

[DOI]

Gudmund Skovbjerg Frandsen

Proceedings of the Unusual Applications of Number Theory, 2000

1999

Number Theory.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

The Computational Complexity of Some Problems of Linear Algebra.

[BibT_eX]

[DOI]

Jonathan F. Buss

J. Comput. Syst. Sci., 1999

Separating Words with Small Grammars.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1999

An Efficient Algorithm for Computing the ith letter of 4na.

[BibT_eX]

[DOI]

David Swart

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

New problems of pattern avoidance.

[BibT_eX]

[DOI]

John Loftus

Proceedings of the Developments in Language Theory, 1999

1998

Generalized Perturbed Symmetry.

[BibT_eX]

[DOI]

Eur. J. Comb., 1998

On Minimal Words With Given Subword Complexity.

[BibT_eX]

[DOI]

Electron. J. Comb., 1998

Extremal Infinite Overlap-Free Binary Words.

[BibT_eX]

[DOI]

James D. Currie

Electron. J. Comb., 1998

Automaticity III: Polynomial Automaticity and Context-Free Languages.

[BibT_eX]

[DOI]

Ian Glaister

Comput. Complex., 1998

The Ubiquitous Prouhet-Thue-Morse Sequence.

[BibT_eX]

[DOI]

Proceedings of the Sequences and their Applications, 1998

1997

Social Issues in Canada's Information Society.

[BibT_eX]

[DOI]

Harriet Lyons

Inf. Soc., 1997

Automaticity II: Descriptional Complexity in the Unary Case.

[BibT_eX]

[DOI]

Carl Pomerance

John Michael Robson

Gudmund Skovbjerg Frandsen

Theor. Comput. Sci., 1997

Automatic Maps in Exotic Numeration System.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1997

The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract).

[BibT_eX]

[DOI]

Jonathan F. Buss

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1996

On the Vector Space of the Automatic Reals.

[BibT_eX]

[DOI]

Siegfried Lehr

John Tromp

Theor. Comput. Sci., 1996

Results and estimates on pseudopowers.

[BibT_eX]

[DOI]

Math. Comput., 1996

Automaticity I: Properties of a Measure of Descriptional Complexity.

[BibT_eX]

[DOI]

Yuri Breitbart

J. Comput. Syst. Sci., 1996

A Lower Bound Technique for the Size of Nondeterministic Finite Automata.

[BibT_eX]

[DOI]

Ian Glaister

Inf. Process. Lett., 1996

Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract).

[BibT_eX]

[DOI]

Ian Glaister

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995

Subword Complexity of a Generalized Thue-Morse Word.

[BibT_eX]

[DOI]

John Tromp

Inf. Process. Lett., 1995

1994

Numeration Systems, Linear Recurrences, and Regular Sets

[BibT_eX]

[DOI]

Inf. Comput., September, 1994

A Minimization Problem.

[BibT_eX]

[DOI]

SIAM Rev., 1994

Analysis of a Left-Shift Binary GCD Algorithm.

[BibT_eX]

[DOI]

Jonathan P. Sorenson

J. Symb. Comput., 1994

on Sparse Languages L such that LL = Sigma.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Automaticity: Properties of a Measure of Descriptional Complexity.

[BibT_eX]

[DOI]

Yuri Breitbart

Proceedings of the STACS 94, 1994

1993

Factor Refinement.

[BibT_eX]

[DOI]

James R. Driscoll

J. Algorithms, 1993

On the maximum number of distinct factors of a binary string.

[BibT_eX]

[DOI]

Graphs Comb., 1993

A binary algorithm for the Jacobi symbol.

[BibT_eX]

[DOI]

Jonathan Sorenson

SIGSAM Bull., 1993

1992

The Ring of k-Regular Sequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Pattern Spectra, Substring Enumeration, and Automatic Sequences.

[BibT_eX]

[DOI]

Patrick Morton

Theor. Comput. Sci., 1992

Randomized algorithms in "primitive" cultures or what is the oracle complexity of a dead chicken?

[BibT_eX]

[DOI]

SIGACT News, 1992

The "3x + 1" Problem and Finite Automata.

[BibT_eX]

David A. Wilson

Bull. EATCS, 1992

Characterizing Regular Languages with Polynomial Densities.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1990

On the Worst Case of Three Algorithms for Computing the Jacobi Symbol.

[BibT_eX]

[DOI]

J. Symb. Comput., 1990

1989

Analysis of an Infinite Product Algorithm.

[BibT_eX]

[DOI]

Péter Hajnal

SIAM J. Discret. Math., 1989

Wire bending.

[BibT_eX]

[DOI]

Michel Mendès France

J. Comb. Theory A, 1989

Sur Des Points Fixes De Morphismes D'Un Monoïde Libre.

[BibT_eX]

[DOI]

J. Bétréma

RAIRO Theor. Informatics Appl., 1989

Two methods for generating fractals.

[BibT_eX]

[DOI]

Jorge Stolfi

Comput. Graph., 1989

1988

A Generalization of Automatic Sequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Fractals, bitmaps, and APL.

[BibT_eX]

[DOI]

ACM SIGAPL APL Quote Quad, 1988

A Subset Coloring Algorithm and Its Applications to Computer Graphics.

[BibT_eX]

[DOI]

David Rubinstein

Mario Szegedy

Commun. ACM, 1988

1986

Sums of Divisors, Perfect Numbers and Factoring.

[BibT_eX]

[DOI]

Gary L. Miller

SIAM J. Comput., 1986

1985

Number-Theoretic Functions Which Are Equivalent to Number of Divisors.

[BibT_eX]

[DOI]

Adi Shamir

Inf. Process. Lett., 1985

Factoring with Cyclotomic Polynomials

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract)

[BibT_eX]

[DOI]

Gary L. Miller

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

Merrily we roll along: Some aspects of?

[BibT_eX]

[DOI]

Proceedings of the international conference on APL, 1983

1982

Computational simplicial homology in APL.

[BibT_eX]

[DOI]

Proceedings of the international conference on APL, 1982

1981

Infinite arrays and diagonalization.

[BibT_eX]

[DOI]

Proceedings of the international conference on APL, 1981

1976

The prime factorization of 1.

[BibT_eX]

[DOI]