Real functions computable by finite automata using affine representations.
From MaRDI portal
Publication:1607295
DOI10.1016/S0304-3975(01)00095-0zbMath1039.68050MaRDI QIDQ1607295
Publication date: 31 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Finite automaton; Real number computation; Affine representation; Piecewise affine function; Sub-self-similarity
Related Items
Unnamed Item, Smooth finitely computable functions are affine, or why quantum systems cause waves, Quantization causes waves: smooth finitely computable functions are affine, A tetrachotomy for expansions of the real ordered additive group
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational complexity of real functions
- A domain-theoretic approach to computability on the real line
- Real functions defined by transducers
- Topological properties of real number representations.
- Affine mappings defined by finite transducers
- On continued fractions and finite automata