๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the base-dependence of sets of numbers recognizable by finite automata

โœ Scribed by Alan Cobham

Publisher
Springer
Year
1969
Tongue
English
Weight
546 KB
Volume
3
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Number of Sets Definable by Polyn
On the Number of Sets Definable by Polynomials
โœ Gabriela Jeronimo; Juan Sabia ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 102 KB

We show that the known algorithms used to re-write any first order quantifierfree formula over an algebraically closed field into its normal disjunctive form are essentially optimal. This result follows from an estimate of the number of sets definable by equalities and inequalities of fixed polynomi

On the Number of Solutions of a Linear E
On the Number of Solutions of a Linear Equation over Finite Sets
โœ Vsevolod F. Lev ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 300 KB

The largest possible number of representations of an integer in the k-fold sumset kA=A+ } } } +A is maximal for A being an arithmetic progression. More generally, consider the number of solutions of the linear equation where c i {0 and \* are fixed integer coefficients, and where the variables a i