Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Read-only_Turing_machine> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Read-only_Turing_machine abstract "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.".
- Read-only_Turing_machine wikiPageExternalLink 09.ppt.
- Read-only_Turing_machine wikiPageID "14103660".
- Read-only_Turing_machine wikiPageRevisionID "603029155".
- Read-only_Turing_machine hasPhotoCollection Read-only_Turing_machine.
- Read-only_Turing_machine subject Category:Turing_machine.
- Read-only_Turing_machine comment "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.".
- Read-only_Turing_machine label "Máquina de Turing somente-leitura".
- Read-only_Turing_machine label "Read-only Turing machine".
- Read-only_Turing_machine sameAs Máquina_de_Turing_somente-leitura.
- Read-only_Turing_machine sameAs m.03cts80.
- Read-only_Turing_machine sameAs Q7300342.
- Read-only_Turing_machine sameAs Q7300342.
- Read-only_Turing_machine wasDerivedFrom Read-only_Turing_machine?oldid=603029155.
- Read-only_Turing_machine isPrimaryTopicOf Read-only_Turing_machine.