Jason P. Bell

Christian Schulz

CoRR, 2024

2023

Quantitative estimates for the size of an intersection of sparse automatic sets.

[BibT_eX]

[DOI]

Seda Albayrak

Theor. Comput. Sci., October, 2023

Cogrowth series for free products of finite groups.

[BibT_eX]

[DOI]

Haggai Liu

Marni Mishna

Int. J. Algebra Comput., 2023

Duality of lattices associated to left and right quotients.

[BibT_eX]

[DOI]

Daniel Smertnig

Hellis Tamm

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

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields.

[BibT_eX]

[DOI]

Daniel Smertnig

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022

Lie complexity of words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Automatic sequences of rank two.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2022

Counterexamples to a Conjecture of Dombi in Additive Number Theory.

[BibT_eX]

[DOI]

CoRR, 2022

Computing the linear hull: Deciding Sequential? and Unambiguous? for weighted automata over fields.

[BibT_eX]

[DOI]

Daniel Smertnig

CoRR, 2022

Topological invariants for words of linear factor complexity.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2022

2021

An analogue of Ruzsa's conjecture for polynomials over finite fields.

[BibT_eX]

[DOI]

Khoa D. Nguyen

J. Comb. Theory A, 2021

2020

Additive Number Theory via Approximation by Regular Languages.

[BibT_eX]

[DOI]

Thomas F. Lidbetter

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

The upper density of an automatic set is rational.

[BibT_eX]

[DOI]

CoRR, 2020

2018

Becker's conjecture on Mahler functions.

[BibT_eX]

[DOI]

CoRR, 2018

2017

On a dynamical Mordell-Lang conjecture for coherent sheaves.

[BibT_eX]

[DOI]

Matthew Satriano

Susan J. Sierra

J. Lond. Math. Soc., 2017

Power series with coefficients from a finite set.

[BibT_eX]

[DOI]

Shaoshi Chen

J. Comb. Theory A, 2017

Power series approximations to Fekete polynomials.

[BibT_eX]

[DOI]

Igor E. Shparlinski

J. Approx. Theory, 2017

When is an automatic set an additive basis?

[BibT_eX]

[DOI]

Kathryn Hare

CoRR, 2017

2014

Integral Cayley Graphs and Groups.

[BibT_eX]

[DOI]

Azhvan Sheikh Ahmady

Bojan Mohar

SIAM J. Discret. Math., 2014

Symmetric Groups and Quotient Complexity of Boolean Operations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2012

Monadic second-order classes of forests with a monadic second-order 0-1 law.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2012

2010

Characteristic Points of Recursive Systems.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

2009

A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2009

A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems

[BibT_eX]

[DOI]

CoRR, 2009

Spectra and Systems of Equations.

[BibT_eX]

Stanley N. Burris

Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009

Compton's Method for Proving Logical Limit Laws.

[BibT_eX]

Stanley N. Burris

Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009

2007

Exponential lower bounds for the number of words of uniform length avoiding a pattern.

[BibT_eX]

[DOI]

Teow Lim Goh

Inf. Comput., 2007

p-adic valuations and k-regular sequences.

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

Counting Rooted Trees: The Universal Law t(n)~C ρ-n n-3/2.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

2005

Unavoidable and Almost Unavoidable Sets of Words.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2005

On the values attained by a k-regular sequence.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2005

2004

Partition Identities I: Sandwich Theorems and Logical 0-1 Laws.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

2000

Asymptotics for the Probability of Connectedness and the Distribution of Number of Components.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

When Structures Are Almost Surely Connected.

[BibT_eX]

[DOI]