Real functions incrementally computable by finite automata

DOI10.1016/J.TCS.2003.11.015MaRDI QIDQ1826628zbMATH OpenOpenAlexFDO

Authors Michal Konečný

Publication date 6 August 2004

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

Full work available at URL https://doi.org/10.1016/j.tcs.2003.11.015

zbMATH Keywords

Finite automatonReal number computationSub-self-similarityMöbius transformation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Real functions computable by finite automata using affine representations.
• Finite Automata Computing Real Functions
• Another representation of finite transducers over real numbers
• Algorithmic questions for real functions
• Finite state transducers for modular Möbius number systems

Cites work

• scientific article; zbMATH DE number 3427224 (Why is no real title available?)
• scientific article; zbMATH DE number 1189297 (Why is no real title available?)
• scientific article; zbMATH DE number 1231567 (Why is no real title available?)
• scientific article; zbMATH DE number 1542841 (Why is no real title available?)
• A domain-theoretic approach to computability on the real line
• On continued fractions and finite automata

Cited in

(4)

• Algorithmic questions for real functions
• Real functions computable by finite automata using affine representations.
• Approximation of continuous functions by finite automata
• From Coinductive Proofs to Exact Real Arithmetic

This page was built for publication: Real functions incrementally computable by finite automata

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