scientific article; zbMATH DE number 3883610

MaRDI QIDQ3217602zbMATH OpenFDO

Authors Shigeki Iwata, Takumi Kasai

Publication date 1984

zbMATH Keywords

finite transducersspace bounded deterministic Turing machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3984575
• ${\text{ASPACE}}(o(\log \log n))$ is Regular
• On efficient deterministic simulation of turing machine computations below logaspace
• Trading determinism for time in space bounded computations
• scientific article; zbMATH DE number 177808

Cited in

(1)

• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs

This page was built for publication:

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