Amanote Research

Amanote Research

    RegisterSign In

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

Logical Methods in Computer Science - Germany
doi 10.2168/lmcs-6(1:6)2010
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

February 24, 2010

Authors
Bernard BoigelotJulien BrustenVéronique Bruyère
Publisher

Logical Methods in Computer Science e.V.


Related search

On the Multiple Borsuk Numbers of Sets

Israel Journal of Mathematics
Mathematics
2013English

Arithmetic Meyer Sets and Finite Automata

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

Arithmetic Representations of Real Numbers in Terms of Self-Similar Sets

Annales Academiae Scientiarum Fennicae Mathematica
Mathematics
2019English

On Normal Sets of Numbers

Acta Arithmetica
Number TheoryAlgebra
1972English

On Finite Monoids of Cellular Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

On the Degree of Ambiguity of Finite Automata

English

Finite-State Automata on Infinite Inputs

2012English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

The Modeling of Counter Machines by Two-Head Finite Automata

Automatic Control and Computer Sciences
ControlSystems EngineeringSignal ProcessingSoftware
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy