Amanote Research

Amanote Research

    RegisterSign In

Arithmetic Meyer Sets and Finite Automata

Information and Computation - United States
doi 10.1016/j.ic.2005.05.002
Full Text
Open PDF
Abstract

Available in full text

Categories
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
Date

September 1, 2005

Authors
Shigeki AkiyamaFrédérique BassinoChristiane Frougny
Publisher

Elsevier BV


Related search

Automata for Arithmetic Meyer Sets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

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

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

The Meyer Property of Cut-And-Project Sets

Journal of Physics A: Mathematical and General
2004English

Arithmetic Properties of Thin Sets

Pacific Journal of Mathematics
Mathematics
1988English

Learning Stochastic Finite Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Finite-State Dimension and Real Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy