On the linearity of on-line computable functions

DOI10.1016/0304-3975(95)00251-0zbMath0871.68026OpenAlexW1970133869MaRDI QIDQ1349929

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)

Related Items (1)

Deterministic synchronization of automata with bounded delay

Cites Work

• Unnamed Item
• On-Line Algorithms for Division and Multiplication
• Some characterizations of functions computable in on-line arithmetic

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