The range of non-linear natural polynomials cannot be context-free

01/12/2019
by   Dömötör Pálvölgyi, et al.
0

Suppose that some polynomial f with rational coefficients takes only natural values at natural numbers, i.e., L={f(n)| n∈ N}⊂ N. We show that the base-k representation of L is a context-free language if and only if f is linear, answering a question of Shallit. The proof is based on a new criterion for context-freeness, which is a combination of the Interchange lemma and a generalization of the Pumping lemma.

READ FULL TEXT

page 1

page 2

page 3

research
04/09/2018

Definite Sums as Solutions of Linear Recurrences With Polynomial Coefficients

We present an algorithm which, given a linear recurrence operator L with...
research
01/04/2019

Decomposing tropical rational functions

An algorithm is designed which decomposes a tropical univariate rational...
research
03/11/2016

A short proof that O_2 is an MCFL

We present a new proof that O_2 is a multiple context-free language. It ...
research
07/27/2023

Linear Termination over N is Undecidable

Recently it was shown that it is undecidable whether a term rewrite syst...
research
09/06/2022

A Complete Characterization of Bounded Motion Polynomials Admitting a Factorization with Linear Factors

Motion polynomials (polynomials over the dual quaternions with the non-z...
research
08/14/2017

Vanishing of Littlewood-Richardson polynomials is in P

J. DeLoera-T. McAllister and K. D. Mulmuley-H. Narayanan-M. Sohoni indep...
research
08/02/2020

Decision problems for linear recurrences involving arbitrary real numbers

We study the decidability of the Skolem Problem, the Positivity Problem,...

Please sign up or login with your details

Forgot password? Click here to reset