Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00616931n
Noun Concept
JA
No term available
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
Relations
Sources
IS A
チューリングマシン

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