Jason P. Bell

44 papers A* 1C 1Journal 38Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Dynamical sequences: closure properties and automatic identity proving.
CoRR
Jason P. Bell, Yuxuan Sun
2025 J jnl
There are no good infinite families of toric codes.
J. Comb. Theory, Ser. A
Jason P. Bell, Sean Monahan, Matthew Satriano, Karen Situ, Zheng Xie
2024 J jnl
Consecutive Power Occurrences in Sturmian Words.
CoRR
Jason P. Bell, Christian Schulz, Jeffrey O. Shallit
2024 J jnl
There are no good infinite families of toric codes.
CoRR
Jason P. Bell, Sean Monahan, Matthew Satriano, Karen Situ, Zheng Xie
2023 J jnl
Cogrowth series for free products of finite groups.
Int. J. Algebra Comput.
Jason P. Bell, Haggai Liu, Marni Mishna
2023 A* conf
Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields.
LICS
Jason P. Bell, Daniel Smertnig
2023 — conf
Duality of lattices associated to left and right quotients.
AFL
Jason P. Bell, Daniel Smertnig, Hellis Tamm
2023 J jnl
Quantitative estimates for the size of an intersection of sparse automatic sets.
CoRR
Seda Albayrak, Jason P. Bell
2023 J jnl
Quantitative estimates for the size of an intersection of sparse automatic sets.
Theor. Comput. Sci.
Seda Albayrak, Jason P. Bell
2022 J jnl
Automatic sequences of rank two.
RAIRO Theor. Informatics Appl.
Jason P. Bell, Jeffrey O. Shallit
2022 J jnl
Computing the linear hull: Deciding Sequential? and Unambiguous? for weighted automata over fields.
CoRR
Jason P. Bell, Daniel Smertnig
2022 J jnl
Counterexamples to a Conjecture of Dombi in Additive Number Theory.
CoRR
Jason P. Bell, Jeffrey O. Shallit
2022 J jnl
Lie complexity of words.
Theor. Comput. Sci.
Jason P. Bell, Jeffrey O. Shallit
2022 J jnl
Topological invariants for words of linear factor complexity.
Adv. Appl. Math.
Jason P. Bell
2022 J jnl
Topological invariants for words of linear factor complexity.
CoRR
Jason P. Bell
2021 J jnl
An analogue of Ruzsa's conjecture for polynomials over finite fields.
J. Comb. Theory A
Jason P. Bell, Khoa D. Nguyen
2021 J jnl
Automatic Sequences of Rank Two.
CoRR
Jason P. Bell, Jeffrey O. Shallit
2021 J jnl
Lie complexity of words.
CoRR
Jason P. Bell, Jeffrey O. Shallit
2020 J jnl
Additive Number Theory via Approximation by Regular Languages.
Int. J. Found. Comput. Sci.
Jason P. Bell, Thomas F. Lidbetter, Jeffrey O. Shallit
2020 J jnl
The upper density of an automatic set is rational.
CoRR
Jason P. Bell
2018 C conf
Additive Number Theory via Approximation by Regular Languages.
DLT
Jason P. Bell, Thomas Finn Lidbetter, Jeffrey O. Shallit
2018 J jnl
Additive Number Theory via Approximation by Regular Languages.
CoRR
Jason P. Bell, Thomas Finn Lidbetter, Jeffrey O. Shallit
2018 J jnl
Becker's conjecture on Mahler functions.
CoRR
Jason P. Bell, Frédéric Chyzak, Michael Coons, Philippe Dumas
2017 J jnl
On a dynamical Mordell-Lang conjecture for coherent sheaves.
J. Lond. Math. Soc.
Jason P. Bell, Matthew Satriano, Susan J. Sierra
2017 J jnl
Power series approximations to Fekete polynomials.
J. Approx. Theory
Jason P. Bell, Igor E. Shparlinski
2017 J jnl
Power series with coefficients from a finite set.
J. Comb. Theory A
Jason P. Bell, Shaoshi Chen
2017 J jnl
When is an automatic set an additive basis?
CoRR
Jason P. Bell, Kathryn Hare, Jeffrey O. Shallit
2014 J jnl
Integral Cayley Graphs and Groups.
SIAM J. Discret. Math.
Azhvan Sheikh Ahmady, Jason P. Bell, Bojan Mohar
2014 — conf
Symmetric Groups and Quotient Complexity of Boolean Operations.
ICALP (2)
Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis
2013 J jnl
Symmetric Groups and Quotient Complexity of Boolean Operations.
CoRR
Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis
2012 J jnl
Monadic second-order classes of forests with a monadic second-order 0-1 law.
Discret. Math. Theor. Comput. Sci.
Jason P. Bell, Stanley Burris, Karen A. Yeats
2010 J jnl
Characteristic Points of Recursive Systems.
Electron. J. Comb.
Jason P. Bell, Stanley Burris, Karen A. Yeats
2009 J jnl
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
CoRR
Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo
2009 J jnl
A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems.
Int. J. Algebra Comput.
Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo
2009 — conf
Compton's Method for Proving Logical Limit Laws.
AMS-ASL Joint Special Session
Jason P. Bell, Stanley N. Burris
2009 — conf
Spectra and Systems of Equations.
AMS-ASL Joint Special Session
Jason P. Bell, Stanley N. Burris, Karen A. Yeats
2007 J jnl
Exponential lower bounds for the number of words of uniform length avoiding a pattern.
Inf. Comput.
Jason P. Bell, Teow Lim Goh
2007 J jnl
p-adic valuations and k-regular sequences.
Discret. Math.
Jason P. Bell
2006 J jnl
Counting Rooted Trees: The Universal Law t(n)~C ρ
Electron. J. Comb.
Jason P. Bell, Stanley Burris, Karen A. Yeats
2005 J jnl
On the values attained by a
Adv. Appl. Math.
Jason P. Bell
2005 J jnl
Unavoidable and Almost Unavoidable Sets of Words.
Int. J. Algebra Comput.
Jason P. Bell
2004 J jnl
Partition Identities I: Sandwich Theorems and Logical 0-1 Laws.
Electron. J. Comb.
Jason P. Bell, Stanley Burris
2000 J jnl
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components.
Electron. J. Comb.
Jason P. Bell, Edward A. Bender, Peter J. Cameron, L. Bruce Richmond
2000 J jnl
When Structures Are Almost Surely Connected.
Electron. J. Comb.
Jason P. Bell