Real functions computable by finite automata using affine representations.
type: Item
instance of: scholarly article
title: Real functions computable by finite automata using affine representations.
zbMATH Open document ID: 1039.68050
DOI: 10.1016/S0304-3975(01)00095-0
author: Michal Konečný
published in: Theoretical Computer Science
publication date: 2002-07-31T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1774168
zbMATH Keywords: Real number computation
zbMATH Keywords: Finite automaton
zbMATH Keywords: Affine representation
zbMATH Keywords: Sub-self-similarity
zbMATH Keywords: Piecewise affine function
MaRDI profile type: Publication
cites work: Topological properties of real number representations.
cites work: A domain-theoretic approach to computability on the real line
cites work: Q3839072
cites work: Q4002474
cites work: Computational complexity of real functions
cites work: Real functions defined by transducers
cites work: Q4222886
cites work: On continued fractions and finite automata
cites work: Affine mappings defined by finite transducers
cites work: Q4217582
full work available at URL: s0304-3975(01)00095-0
OpenAlex ID: W2150586693
description: scientific article; zbMATH DE number 1774168