On the linearity of on-line computable functions

DOI10.1016/0304-3975(95)00251-0MaRDI QIDQ1349929zbMATH OpenOpenAlexFDO

Authors Hratchia Pélibossian

Publication date 27 February 1997

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

Full work available at URL https://doi.org/10.1016/0304-3975(95)00251-0

zbMATH Keywords

finite automata

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Some characterizations of functions computable in on-line arithmetic
• Finite Automata Computing Real Functions
• scientific article; zbMATH DE number 3982522
• Completeness problem for the class of linear automata functions
• scientific article; zbMATH DE number 3988715

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• On-Line Algorithms for Division and Multiplication
• Some characterizations of functions computable in on-line arithmetic

Cited in

(2)

• Deterministic synchronization of automata with bounded delay
• Some characterizations of functions computable in on-line arithmetic

This page was built for publication: On the linearity of on-line computable functions

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