Real functions incrementally computable by finite automata

DOI10.1016/J.TCS.2003.11.015zbMath1072.68057OpenAlexW2168195516MaRDI QIDQ1826628

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

Möbius transformationFinite automatonReal number computationSub-self-similarity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

From Coinductive Proofs to Exact Real Arithmetic

Cites Work

• A domain-theoretic approach to computability on the real line
• On continued fractions and finite automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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