Unrecognizable Sets of Numbers
From MaRDI portal
Cites work
Cited in
(29)- The sum of digits of squares
- A definition of measures over language space
- Tape-reversal bounded Turing machine computations
- Uniform tag sequences
- Relative position in binary substitutions
- On the base-dependence of sets of numbers recognizable by finite automata
- Arithmetics properties of substitutions and infinite automata
- Automata and transcendence in positive characteristic
- How to prove that a sequence is not automatic
- Automatic sequences and parity of partition functions
- Two memory bounds for the recognition of primes by automata
- On a characterization of the nonregular set of primes
- Two memory bounds for the recognition of primes by automata
- It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
- Properties and limits of recognition of sets of integers by countable automata
- On the complexity of a family of \(k\)-context-free sequences
- Automaticity. IV: Sequences, sets, and diversity
- Higher order rule characterization of heuristics of compass and straight edge constructions in geometry
- The characteristic sequence of the integers that are the sum of two squares is not morphic
- Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata
- (Non)Automaticity of number theoretic functions
- Multiplicative functions and \(k\)-automatic sequences
- On a problem of Gelfond: the sum of digits of prime numbers
- Construction of some nonautomatic sequences by cellular automata
- NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES
- Logical characterization of recognizable sets of polynomials over a finite field
- Tree adjunct languages as integer set recognizers†
- Rudin-Shapiro sequences along squares
- Support of an algebraic series as the range of a recursive sequence
This page was built for publication: Unrecognizable Sets of Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5552168)
