When Structures Are Almost Surely Connected. - Jason P. Bell (Electron. J. Comb., 2000)

Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. - Jason P. Bell; Edward A. Bender; Peter J. Cameron; L. Bruce Richmond (Electron. J. Comb., 2000)

Partition Identities I: Sandwich Theorems and Logical 0-1 Laws. - Jason P. Bell; Stanley Burris (Electron. J. Comb., 2004)

On the values attained by a k-regular sequence. - Jason P. Bell (Adv. Appl. Math., 2005)

Unavoidable and Almost Unavoidable Sets of Words. - Jason P. Bell (Int. J. Algebra Comput., 2005)

Counting Rooted Trees: The Universal Law t(n) C ρ-n n-3/2. - Jason P. Bell; Stanley Burris; Karen A. Yeats (Electron. J. Comb., 2006)

p-adic valuations and k-regular sequences. - Jason P. Bell (Discret. Math., 2007)

Exponential lower bounds for the number of words of uniform length avoiding a pattern. - Jason P. Bell; Teow Lim Goh (Inf. Comput., 2007)

Compton's Method for Proving Logical Limit Laws. - Jason P. Bell; Stanley N. Burris (AMS-ASL Joint Special Session, 2009)

Spectra and Systems of Equations. - Jason P. Bell; Stanley N. Burris; Karen A. Yeats (AMS-ASL Joint Special Session, 2009)

A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems - Jason P. Bell; Emilie Charlier; Aviezri S. Fraenkel; Michel Rigo (CoRR, 2009)

A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems. - Jason P. Bell; Emilie Charlier; Aviezri S. Fraenkel; Michel Rigo (Int. J. Algebra Comput., 2009)

Characteristic Points of Recursive Systems. - Jason P. Bell; Stanley Burris; Karen A. Yeats (Electron. J. Comb., 2010)

Monadic second-order classes of forests with a monadic second-order 0-1 law. - Jason P. Bell; Stanley Burris; Karen A. Yeats (Discret. Math. Theor. Comput. Sci., 2012)

Symmetric Groups and Quotient Complexity of Boolean Operations. - Jason P. Bell; Janusz A. Brzozowski; Nelma Moreira; Rogério Reis (ICALP (2), 2014)

Integral Cayley Graphs and Groups. - Azhvan Sheikh Ahmady; Jason P. Bell; Bojan Mohar (SIAM J. Discret. Math., 2014)

When is an automatic set an additive basis? - Jason P. Bell; Kathryn Hare; Jeffrey O. Shallit (CoRR, 2017)

Power series approximations to Fekete polynomials. - Jason P. Bell; Igor E. Shparlinski (J. Approx. Theory, 2017)

Power series with coefficients from a finite set. - Jason P. Bell; Shaoshi Chen (J. Comb. Theory A, 2017)

On a dynamical Mordell-Lang conjecture for coherent sheaves. - Jason P. Bell; Matthew Satriano; Susan J. Sierra (J. Lond. Math. Soc., 2017)

Becker's conjecture on Mahler functions. - Jason P. Bell; Frédéric Chyzak; Michael Coons; Philippe Dumas 001 (CoRR, 2018)

The upper density of an automatic set is rational. - Jason P. Bell (CoRR, 2020)

Additive Number Theory via Approximation by Regular Languages. - Jason P. Bell; Thomas F. Lidbetter; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2020)

An analogue of Ruzsa's conjecture for polynomials over finite fields. - Jason P. Bell; Khoa D. Nguyen (J. Comb. Theory A, 2021)

Topological invariants for words of linear factor complexity. - Jason P. Bell (Adv. Appl. Math., 2022)

Computing the linear hull: Deciding Sequential? and Unambiguous? for weighted automata over fields. - Jason P. Bell; Daniel Smertnig (CoRR, 2022)

Counterexamples to a Conjecture of Dombi in Additive Number Theory. - Jason P. Bell; Jeffrey O. Shallit (CoRR, 2022)

Automatic sequences of rank two. - Jason P. Bell; Jeffrey O. Shallit (RAIRO Theor. Informatics Appl., 2022)

Lie complexity of words. - Jason P. Bell; Jeffrey O. Shallit (Theor. Comput. Sci., 2022)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields. - Jason P. Bell; Daniel Smertnig (LICS, 2023)

Duality of lattices associated to left and right quotients. - Jason P. Bell; Daniel Smertnig; Hellis Tamm (AFL, 2023)

Cogrowth series for free products of finite groups. - Jason P. Bell; Haggai Liu; Marni Mishna (Int. J. Algebra Comput., 2023)

Quantitative estimates for the size of an intersection of sparse automatic sets. - Seda Albayrak; Jason P. Bell (Theor. Comput. Sci., 2023)

Consecutive Power Occurrences in Sturmian Words. - Jason P. Bell; Christian Schulz 013; Jeffrey O. Shallit (CoRR, 2024)

There are no good infinite families of toric codes. - Jason P. Bell; Sean Monahan; Matthew Satriano; Karen Situ; Zheng Xie (J. Comb. Theory, Ser. A, 2025)