Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Two-way_deterministic_finite_automaton> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items 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 wikiPageRevisionID "594347480".
- Two-way_deterministic_finite_automaton hasPhotoCollection Two-way_deterministic_finite_automaton.
- 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 label "Zweiwege-DFA".
- Two-way_deterministic_finite_automaton sameAs Zweiwege-DFA.
- 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=594347480.
- Two-way_deterministic_finite_automaton isPrimaryTopicOf Two-way_deterministic_finite_automaton.