Real functions computable by finite automata using affine representations.

DOI10.1016/S0304-3975(01)00095-0MaRDI QIDQ1607295zbMATH OpenOpenAlexFDO

Authors 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

Recommendations

• Finite Automata Computing Real Functions
• Real functions incrementally computable by finite automata
• Another representation of finite transducers over real numbers
• Affine mappings defined by finite transducers
• Real functions defined by transducers

Cites work

• scientific article; zbMATH DE number 1189297 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1222088 (Why is no real title available?)
• scientific article; zbMATH DE number 1231567 (Why is no real title available?)
• A domain-theoretic approach to computability on the real line
• Affine mappings defined by finite transducers
• Computational complexity of real functions
• On continued fractions and finite automata
• Real functions defined by transducers
• Topological properties of real number representations.

Cited in

(16)

• scientific article; zbMATH DE number 1400044 (Why is no real title available?)
• Smooth finitely computable functions are affine, or why quantum systems cause waves
• Algorithmic questions for real functions
• Quantization causes waves: smooth finitely computable functions are affine
• scientific article; zbMATH DE number 7168153 (Why is no real title available?)
• Some extremal problems for continuous real functions specified by transducers
• Operations on R-numbers
• Graph representation functions computable by finite automata
• Binary operations on automatic functions
• Affine mappings defined by finite transducers
• A tetrachotomy for expansions of the real ordered additive group
• Representation of linear functionals over partially continuous functions
• Representation by an automaton of continuous functions of the torus
• The \(p\)-adic theory of automata functions
• On finite-time computability preserving conversions
• Real functions incrementally computable by finite automata

This page was built for publication: Real functions computable by finite automata using affine representations.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607295)