Finite Automata and the Set of Squares
From MaRDI portal
Publication:5728776
DOI10.1145/321186.321196zbMath0118.12601OpenAlexW1973951109MaRDI QIDQ5728776
Publication date: 1963
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321186.321196
Related Items (15)
Unrecognizable Sets of Numbers ⋮ Arithmetics properties of substitutions and infinite automata ⋮ Construction of some nonautomatic sequences by cellular automata ⋮ Rudin–Shapiro sequences along squares ⋮ The sum of digits of squares ⋮ Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata ⋮ Properties and limits of recognition of sets of integers by countable automata ⋮ (Non)Automaticity of number theoretic functions ⋮ Automata methods in transcendence ⋮ Uniform tag sequences ⋮ Automata and transcendence in positive characteristic ⋮ Two-dimensional finite automata and unacceptable functions ⋮ A definition of measures over language space ⋮ Transcendence of formal power series with rational coefficients ⋮ Support of an algebraic series as the range of a recursive sequence
This page was built for publication: Finite Automata and the Set of Squares
