Space complexity in on-line computation

DOI10.1016/0022-0000(82)90032-0zbMath0491.68046OpenAlexW2036841467MaRDI QIDQ1167539

Takumi Kasai, Hajime Machida

Publication date: 1982

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(82)90032-0

zbMATH Keywords

linear spaceinteger multiplicationobject code generationon-line Turing machinerecognition of powers of 3

Mathematics Subject Classification ID

Related Items (1)

A survey of space complexity

Cites Work

• Fast on-line integer multiplication
• On the Recognition of Primes by Automata
• A Remark on Acceptable Sets of Numbers
• Two memory bounds for the recognition of primes by automata
• Recognition time of context-free languages by on-line Turing machines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Space complexity in on-line computation