Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Read-only_Turing_machine> ?p ?o }
Showing triples 1 to 53 of
53
with 100 triples 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 wikiPageLength "6130".
- Read-only_Turing_machine wikiPageOutDegree "22".
- Read-only_Turing_machine wikiPageRevisionID "664143661".
- Read-only_Turing_machine wikiPageWikiLink Category:Turing_machine.
- Read-only_Turing_machine wikiPageWikiLink Computability.
- Read-only_Turing_machine wikiPageWikiLink Computational_complexity_theory.
- Read-only_Turing_machine wikiPageWikiLink Context-free_language.
- Read-only_Turing_machine wikiPageWikiLink Deterministic_finite_automaton.
- Read-only_Turing_machine wikiPageWikiLink Formal_language.
- Read-only_Turing_machine wikiPageWikiLink L_(complexity).
- Read-only_Turing_machine wikiPageWikiLink Linear_time.
- Read-only_Turing_machine wikiPageWikiLink NL_(complexity).
- Read-only_Turing_machine wikiPageWikiLink Nondeterministic_finite_automaton.
- Read-only_Turing_machine wikiPageWikiLink Probabilistic_automaton.
- Read-only_Turing_machine wikiPageWikiLink Quantum_computer.
- Read-only_Turing_machine wikiPageWikiLink Quantum_computing.
- Read-only_Turing_machine wikiPageWikiLink Quantum_finite_automata.
- Read-only_Turing_machine wikiPageWikiLink Queue_automaton.
- Read-only_Turing_machine wikiPageWikiLink Regular_language.
- Read-only_Turing_machine wikiPageWikiLink Stack_(abstract_data_type).
- Read-only_Turing_machine wikiPageWikiLink Stack_(data_structure).
- Read-only_Turing_machine wikiPageWikiLink Stack_machine.
- Read-only_Turing_machine wikiPageWikiLink Time_complexity.
- Read-only_Turing_machine wikiPageWikiLink Turing_equivalence.
- Read-only_Turing_machine wikiPageWikiLink Turing_equivalent.
- Read-only_Turing_machine wikiPageWikiLink Turing_machine.
- Read-only_Turing_machine wikiPageWikiLink Turing_machine_equivalents.
- Read-only_Turing_machine wikiPageWikiLink Universal_Turing_machine.
- Read-only_Turing_machine wikiPageWikiLinkText "Read-only Turing machine".
- Read-only_Turing_machine wikiPageWikiLinkText "read-only Turing machine".
- Read-only_Turing_machine hasPhotoCollection Read-only_Turing_machine.
- Read-only_Turing_machine wikiPageUsesTemplate Template:Reflist.
- Read-only_Turing_machine wikiPageUsesTemplate Template:Turing.
- Read-only_Turing_machine subject Category:Turing_machine.
- Read-only_Turing_machine hypernym Class.
- Read-only_Turing_machine type Article.
- Read-only_Turing_machine type Model.
- Read-only_Turing_machine type Article.
- Read-only_Turing_machine type Machine.
- Read-only_Turing_machine type Method.
- Read-only_Turing_machine type Model.
- 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 "Read-only Turing machine".
- Read-only_Turing_machine sameAs ماشین_خواندنی_تورینگ.
- 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=664143661.
- Read-only_Turing_machine isPrimaryTopicOf Read-only_Turing_machine.