Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q378713> ?p ?o }
Showing triples 1 to 21 of
21
with 100 triples per page.
- Q378713 subject Q7036095.
- Q378713 subject Q7142640.
- Q378713 subject Q7483203.
- Q378713 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.".
- Q378713 wikiPageWikiLink Q12321.
- Q378713 wikiPageWikiLink Q1417143.
- Q378713 wikiPageWikiLink Q205170.
- Q378713 wikiPageWikiLink Q214526.
- Q378713 wikiPageWikiLink Q3124458.
- Q378713 wikiPageWikiLink Q450569.
- Q378713 wikiPageWikiLink Q670834.
- Q378713 wikiPageWikiLink Q7036095.
- Q378713 wikiPageWikiLink Q7142640.
- Q378713 wikiPageWikiLink Q729271.
- Q378713 wikiPageWikiLink Q7483203.
- Q378713 wikiPageWikiLink Q751443.
- Q378713 wikiPageWikiLink Q7782354.
- Q378713 wikiPageWikiLink Q849775.
- Q378713 wikiPageWikiLink Q932615.
- Q378713 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.".
- Q378713 label "Deterministic pushdown automaton".