Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Two-way_deterministic_finite_automaton> ?p ?o }
Showing triples 1 to 36 of
36
with 100 triples per page.
- Two-way_deterministic_finite_automaton abstract "In computer science, in particular in automata theory, an automaton is called two-way if it is allowed to re-read its input.".
- Two-way_deterministic_finite_automaton wikiPageExternalLink 2DFA.pdf.
- Two-way_deterministic_finite_automaton wikiPageID "4088117".
- Two-way_deterministic_finite_automaton wikiPageLength "5789".
- Two-way_deterministic_finite_automaton wikiPageOutDegree "15".
- Two-way_deterministic_finite_automaton wikiPageRevisionID "620339205".
- Two-way_deterministic_finite_automaton wikiPageWikiLink Abstract_machine.
- Two-way_deterministic_finite_automaton wikiPageWikiLink Automata_theory.
- Two-way_deterministic_finite_automaton wikiPageWikiLink Category:Automata_theory.
- Two-way_deterministic_finite_automaton wikiPageWikiLink Computer_science.
- Two-way_deterministic_finite_automaton wikiPageWikiLink Dana_Scott.
- Two-way_deterministic_finite_automaton wikiPageWikiLink Deterministic_finite_automaton.
- Two-way_deterministic_finite_automaton wikiPageWikiLink Formal_language.
- Two-way_deterministic_finite_automaton wikiPageWikiLink John_Watrous_(computer_scientist).
- Two-way_deterministic_finite_automaton wikiPageWikiLink Michael_O._Rabin.
- Two-way_deterministic_finite_automaton wikiPageWikiLink Pushdown_automaton.
- Two-way_deterministic_finite_automaton wikiPageWikiLink Quantum_computing.
- Two-way_deterministic_finite_automaton wikiPageWikiLink Read-only_Turing_machine.
- Two-way_deterministic_finite_automaton wikiPageWikiLink Regular_language.
- Two-way_deterministic_finite_automaton wikiPageWikiLink Tuple.
- Two-way_deterministic_finite_automaton wikiPageWikiLinkText "Two-way deterministic finite automaton".
- Two-way_deterministic_finite_automaton wikiPageWikiLinkText "Two-way deterministic finite automaton#Two-way pushdown automaton".
- Two-way_deterministic_finite_automaton hasPhotoCollection Two-way_deterministic_finite_automaton.
- Two-way_deterministic_finite_automaton wikiPageUsesTemplate Template:Comp-sci-theory-stub.
- Two-way_deterministic_finite_automaton wikiPageUsesTemplate Template:Reflist.
- Two-way_deterministic_finite_automaton subject Category:Automata_theory.
- Two-way_deterministic_finite_automaton comment "In computer science, in particular in automata theory, an automaton is called two-way if it is allowed to re-read its input.".
- Two-way_deterministic_finite_automaton label "Two-way deterministic finite automaton".
- Two-way_deterministic_finite_automaton sameAs Zweiwege-DFA.
- Two-way_deterministic_finite_automaton sameAs دستگاه_دو_طرفه_قطعی_متناهی.
- Two-way_deterministic_finite_automaton sameAs Autômato_finito_determinístico_de_dois_sentidos.
- Two-way_deterministic_finite_automaton sameAs m.0bhddc.
- Two-way_deterministic_finite_automaton sameAs Q243800.
- Two-way_deterministic_finite_automaton sameAs Q243800.
- Two-way_deterministic_finite_automaton wasDerivedFrom Two-way_deterministic_finite_automaton?oldid=620339205.
- Two-way_deterministic_finite_automaton isPrimaryTopicOf Two-way_deterministic_finite_automaton.