Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5370010> ?p ?o }
Showing triples 1 to 21 of
21
with 100 triples per page.
- Q5370010 subject Q7036095.
- Q5370010 subject Q7483203.
- Q5370010 abstract "An embedded pushdown automaton or EPDA is a computational model for parsing languages generated by tree-adjoining grammars (TAGs). It is similar to the context-free grammar-parsing pushdown automaton, except that instead of using a plain stack to store symbols, it has a stack of iterated stacks that store symbols, giving TAGs a generative capacity between context-free grammars and context-sensitive grammars, or a subset of the mildly context-sensitive grammars.Embedded pushdown automata should not be confused with nested stack automata which have more computational power.".
- Q5370010 wikiPageWikiLink Q1122506.
- Q5370010 wikiPageWikiLink Q1411840.
- Q5370010 wikiPageWikiLink Q1754022.
- Q5370010 wikiPageWikiLink Q177929.
- Q5370010 wikiPageWikiLink Q182557.
- Q5370010 wikiPageWikiLink Q190913.
- Q5370010 wikiPageWikiLink Q338047.
- Q5370010 wikiPageWikiLink Q6134957.
- Q5370010 wikiPageWikiLink Q6590011.
- Q5370010 wikiPageWikiLink Q7036095.
- Q5370010 wikiPageWikiLink Q730974.
- Q5370010 wikiPageWikiLink Q7483203.
- Q5370010 wikiPageWikiLink Q751443.
- Q5370010 wikiPageWikiLink Q849775.
- Q5370010 wikiPageWikiLink Q908674.
- Q5370010 wikiPageWikiLink Q995679.
- Q5370010 comment "An embedded pushdown automaton or EPDA is a computational model for parsing languages generated by tree-adjoining grammars (TAGs).".
- Q5370010 label "Embedded pushdown automaton".