Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Deterministic_pushdown_automaton> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- Deterministic_pushdown_automaton abstract "In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton . The DPDA accepts the deterministic context-free languages, a proper subset of context-free languages.Machine transitions are based on the current state and input symbol, and also the current topmost symbol of the stack. Symbols lower in the stack are not visible and have no immediate effect. Machine actions include pushing, popping, or replacing the stack top. A deterministic pushdown automaton has at most one legal transition for the same combination of input symbol, state, and top stack symbol. This is where it differs from the nondeterministic pushdown automaton.".
- Deterministic_pushdown_automaton wikiPageID "3972656".
- Deterministic_pushdown_automaton wikiPageRevisionID "551238542".
- Deterministic_pushdown_automaton hasPhotoCollection Deterministic_pushdown_automaton.
- Deterministic_pushdown_automaton subject Category:Automata_theory.
- Deterministic_pushdown_automaton subject Category:Models_of_computation.
- Deterministic_pushdown_automaton type Assistant109815790.
- Deterministic_pushdown_automaton type CausalAgent100007347.
- Deterministic_pushdown_automaton type LivingThing100004258.
- Deterministic_pushdown_automaton type Model110324560.
- Deterministic_pushdown_automaton type ModelsOfComputation.
- Deterministic_pushdown_automaton type Object100002684.
- Deterministic_pushdown_automaton type Organism100004475.
- Deterministic_pushdown_automaton type Person100007846.
- Deterministic_pushdown_automaton type PhysicalEntity100001930.
- Deterministic_pushdown_automaton type Whole100003553.
- Deterministic_pushdown_automaton type Worker109632518.
- Deterministic_pushdown_automaton type YagoLegalActor.
- Deterministic_pushdown_automaton type YagoLegalActorGeo.
- Deterministic_pushdown_automaton comment "In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton . The DPDA accepts the deterministic context-free languages, a proper subset of context-free languages.Machine transitions are based on the current state and input symbol, and also the current topmost symbol of the stack. Symbols lower in the stack are not visible and have no immediate effect. Machine actions include pushing, popping, or replacing the stack top.".
- Deterministic_pushdown_automaton label "Autômato com pilha determinístico".
- Deterministic_pushdown_automaton label "Deterministic pushdown automaton".
- Deterministic_pushdown_automaton label "Deterministyczny automat ze stosem".
- Deterministic_pushdown_automaton label "确定下推自动机".
- Deterministic_pushdown_automaton sameAs Deterministyczny_automat_ze_stosem.
- Deterministic_pushdown_automaton sameAs Autômato_com_pilha_determinístico.
- Deterministic_pushdown_automaton sameAs m.025sxz8.
- Deterministic_pushdown_automaton sameAs Q378713.
- Deterministic_pushdown_automaton sameAs Q378713.
- Deterministic_pushdown_automaton sameAs Deterministic_pushdown_automaton.
- Deterministic_pushdown_automaton wasDerivedFrom Deterministic_pushdown_automaton?oldid=551238542.
- Deterministic_pushdown_automaton isPrimaryTopicOf Deterministic_pushdown_automaton.