Real functions computable by finite automata using affine representations.

DOI10.1016/S0304-3975(01)00095-0zbMath1039.68050OpenAlexW2150586693MaRDI QIDQ1607295

Michal Konečný

Publication date: 31 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00095-0

zbMATH Keywords

Finite automatonReal number computationAffine representationPiecewise affine functionSub-self-similarity

Mathematics Subject Classification ID

Related Items

Smooth finitely computable functions are affine, or why quantum systems cause waves ⋮ The p-adic Theory of Automata Functions ⋮ Unnamed Item ⋮ 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