Algorithmic questions for real functions

DOI10.1007/BF01068797MaRDI QIDQ5750410zbMATH OpenFDO

Authors L. P. Lisovik

Publication date 1987

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01068797

zbMATH Keywords

finite automataTuring machinesdefinition of real functions by automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Constructive and recursive analysis (03F60)

Recommendations

• Finite Automata Computing Real Functions
• Real functions computable by finite automata using affine representations.
• Another representation of finite transducers over real numbers
• Real functions incrementally computable by finite automata
• scientific article; zbMATH DE number 910752

Cited in

(4)

• scientific article; zbMATH DE number 1400044 (Why is no real title available?)
• Operations on R-numbers
• Axiomatic theory of partial continuous functions and the Peano curve
• Real functions incrementally computable by finite automata

This page was built for publication: Algorithmic questions for real functions

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