Amanote Research

Amanote Research

    RegisterSign In

Automata for Arithmetic Meyer Sets

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-24698-5_29
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2004

Authors
Shigeki AkiyamaFrédérique BassinoChristiane Frougny
Publisher

Springer Berlin Heidelberg


Related search

Arithmetic Meyer Sets and Finite Automata

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2005English

Widening Arithmetic Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Models of Arithmetic and Upper Bounds for Arithmetic Sets

Journal of Symbolic Logic
PhilosophyLogic
1994English

Pointwise Ergodic Theorems for Arithmetic Sets

Publications Mathématiques
Mathematics
1989English

Arithmetic Properties of Thin Sets

Pacific Journal of Mathematics
Mathematics
1988English

The Meyer Property of Cut-And-Project Sets

Journal of Physics A: Mathematical and General
2004English

Density of M-Sets in Arithmetic Progression

Acta Arithmetica
Number TheoryAlgebra
1999English

Cardinal Arithmetic and $\Aleph \Sb{1}$-Borel Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1982English

On the Arithmetic Sum of Regular Cantor Sets

Annales de l'Institut Henri Poincare. Annales: Analyse Non Lineaire/Nonlinear Analysis
Applied MathematicsMathematical PhysicsAnalysis
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy