Read-only Turing machine
id:
read-only-turing-machine-202-9477923
title:
Read-only Turing machine
text:
A read-only Turing machine or two-way deterministic finite-state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and can move in both directions across input, except cannot write to its input tape. The machine in its bare form is equivalent to a deterministic finite automaton in computational power, and therefore can only parse a regular language.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Read-only_Turing_machine
date created:
date modified:
2023-07-25T07:01:47Z
main entity:
{"identifier":"Q7300342","url":"https://www.wikidata.org/entity/Q7300342"}
image:
fields total:
13
integrity:
13