Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00616931n
Noun Concept
Categories: Turing machine
EN
read-only Turing machine  Two-way deterministic finite-state automaton
EN
A read-only Turing machine or Two-way deterministic finite-state automaton 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. Wikipedia
Definitions
Relations
Sources
EN
A read-only Turing machine or Two-way deterministic finite-state automaton 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. Wikipedia
IS A
Turing machine
Wikipedia
EN
read-only Turing machine
Wikidata
EN
read-only Turing machine
Wikidata Alias
EN
Two-way deterministic finite-state automaton (2DFA)

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License