| http://dbpedia.org/ontology/abstract
|
Um autômato com pilha embutida ou EPDA é u … Um autômato com pilha embutida ou EPDA é um modelo computacional para linguagens de parsing geradas por gramáticas de adjunção de árvores (TAGs). Ele é similar ao parsing de autômato com pilha para gramática livre de contexto , exceto que ao invés de usar uma simples pilha para armazenar símbolos, ele tem uma pilha de iterações de pilhas que armazena símbolos, dando às TAGs uma capacidade de geração entre gramáticas livres do contexto e gramáticas sensíveis ao contexto, ou um subconjunto de gramáticas levemente sensíveis ao contexto.ramáticas levemente sensíveis ao contexto.
, En linguistique et en théorie des automate … En linguistique et en théorie des automates, un automate à piles intégrées en anglais « embedded pushdown automaton » ou EPDA est une automate pour la reconnaissance d'un langages engendré par une grammaire d'arbres adjoints (en anglais « tree-adjoining grammar » ou TAG). Un tel automate ressemble à un automate à pile utilisé pour l’analyse des langages algébriques, mais à la place d'une pile simple contenant des symboles, il possède une pile composée de piles. Ainsi, la pile d'un EPDA est une constituée d'une suite de piles (ordinaires) juxtaposées. Ceci donne aux grammaires correspondantes une capacité générative plus importante et les situe entre les grammaires algébriques et les grammaires contextuelles ; ces grammaires forment un sous-ensemble des grammaires regroupées sous le terme de (en). Les automates à piles intégrées ne doivent pas être confondues avec les automates à piles emboîtées dont la puissance de reconnaissance est encore plus importante puisque ces derniers reconnaissent les langages indexés.rniers reconnaissent les langages indexés.
, An embedded pushdown automaton or EPDA is … 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, but 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 and context-sensitive grammars, or a subset of mildly context-sensitive grammars.Embedded pushdown automata should not be confused with nested stack automata which have more computational power.omata which have more computational power.
, 嵌入下推自动机或 EPDA 是分析树-邻接文法(TAG)的计算模型。除了不再使用堆栈来存储符号之外，它类似于分析上下文无关文法的下推自动机。它有存储符号的重复堆栈组成的一个栈，这给予了 TAG 在上下文无关文法和上下文有关文法之间的复杂度，或者说是的子集。
|
| http://dbpedia.org/ontology/wikiPageID
|
14345961
|
| http://dbpedia.org/ontology/wikiPageLength
|
9410
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1053050995
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Computational_model +
, http://dbpedia.org/resource/Kleene_closure +
, http://dbpedia.org/resource/Pushdown_automaton +
, http://dbpedia.org/resource/Combinatory_categorial_grammar +
, http://dbpedia.org/resource/Context-free_grammar +
, http://dbpedia.org/resource/Tree-adjoining_grammar +
, http://dbpedia.org/resource/Linear_indexed_grammar +
, http://dbpedia.org/resource/Category:Automata_%28computation%29 +
, http://dbpedia.org/resource/Mildly_context-sensitive_grammar +
, http://dbpedia.org/resource/Computational_linguistics +
, http://dbpedia.org/resource/Stack_%28data_structure%29 +
, http://dbpedia.org/resource/Chomsky_hierarchy +
, http://dbpedia.org/resource/Context-sensitive_grammar +
, http://dbpedia.org/resource/Transformational-generative_grammar +
, http://dbpedia.org/resource/Nested_stack_automata +
, http://dbpedia.org/resource/Category:Models_of_computation +
|
| http://dbpedia.org/property/date
|
February 2014
|
| http://dbpedia.org/property/reason
|
Usually, curly braces build a set , while in a stack, ordering and repetition does matter. Probably, the notation used here is wrong, or at least misleading.
, In the sentence before, was explained to … In the sentence before, was explained to equal , hence {upsilon sub j} would equal {ddagger }; however, now it is claimed to equal {ddagger ,...,ddagger } instead. Moreover, in the rightmost term, it should be explained whether or is meant, and what ddagger applied to the stack alphabet Gamma,or to , is supposed to mean. Finally, is should be explicitly mentioned that +, as I guessed, denotes the Kleene plus. +, as I guessed, denotes the Kleene plus.
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Clarify +
, http://dbpedia.org/resource/Template:Clarify_span +
, http://dbpedia.org/resource/Template:Formal_languages_and_grammars +
, http://dbpedia.org/resource/Template:Cite_book +
, http://dbpedia.org/resource/Template:Citation_needed +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Cleanup +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Automata_%28computation%29 +
, http://dbpedia.org/resource/Category:Models_of_computation +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Model +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Embedded_pushdown_automaton?oldid=1053050995&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Embedded_pushdown_automaton +
|
| owl:sameAs |
http://yago-knowledge.org/resource/Embedded_pushdown_automaton +
, http://fa.dbpedia.org/resource/%D9%85%D8%A7%D8%B4%DB%8C%D9%86_%D9%BE%D8%B4%D8%AA%D9%87%E2%80%8C%D8%A7%DB%8C_%D8%AC%D8%A7%D8%B3%D8%A7%D8%B2%DB%8C%E2%80%8C%D8%B4%D8%AF%D9%87 +
, http://zh.dbpedia.org/resource/%E5%B5%8C%E5%85%A5%E4%B8%8B%E6%8E%A8%E8%87%AA%E5%8A%A8%E6%9C%BA +
, http://pt.dbpedia.org/resource/Aut%C3%B4mato_com_pilha_embutida +
, http://www.wikidata.org/entity/Q5370010 +
, http://dbpedia.org/resource/Embedded_pushdown_automaton +
, http://rdf.freebase.com/ns/m.03d1658 +
, https://global.dbpedia.org/id/4jh27 +
, http://fr.dbpedia.org/resource/Automate_%C3%A0_piles_int%C3%A9gr%C3%A9es +
|
| rdf:type |
http://dbpedia.org/class/yago/Assistant109815790 +
, http://dbpedia.org/class/yago/WikicatModelsOfComputation +
, http://dbpedia.org/class/yago/Organism100004475 +
, http://dbpedia.org/class/yago/Object100002684 +
, http://dbpedia.org/class/yago/LivingThing100004258 +
, http://dbpedia.org/ontology/Person +
, http://dbpedia.org/class/yago/Model110324560 +
, http://dbpedia.org/class/yago/Whole100003553 +
, http://dbpedia.org/class/yago/CausalAgent100007347 +
, http://dbpedia.org/class/yago/Worker109632518 +
, http://dbpedia.org/class/yago/YagoLegalActorGeo +
, http://dbpedia.org/class/yago/PhysicalEntity100001930 +
, http://dbpedia.org/class/yago/Person100007846 +
, http://dbpedia.org/class/yago/YagoLegalActor +
|
| rdfs:comment |
嵌入下推自动机或 EPDA 是分析树-邻接文法(TAG)的计算模型。除了不再使用堆栈来存储符号之外，它类似于分析上下文无关文法的下推自动机。它有存储符号的重复堆栈组成的一个栈，这给予了 TAG 在上下文无关文法和上下文有关文法之间的复杂度，或者说是的子集。
, An embedded pushdown automaton or EPDA is … 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, but 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 and context-sensitive grammars, or a subset of mildly context-sensitive grammars.Embedded pushdown automata should not be confused with nested stack automata which have more computational power.omata which have more computational power.
, En linguistique et en théorie des automate … En linguistique et en théorie des automates, un automate à piles intégrées en anglais « embedded pushdown automaton » ou EPDA est une automate pour la reconnaissance d'un langages engendré par une grammaire d'arbres adjoints (en anglais « tree-adjoining grammar » ou TAG). Les automates à piles intégrées ne doivent pas être confondues avec les automates à piles emboîtées dont la puissance de reconnaissance est encore plus importante puisque ces derniers reconnaissent les langages indexés.rniers reconnaissent les langages indexés.
, Um autômato com pilha embutida ou EPDA é u … Um autômato com pilha embutida ou EPDA é um modelo computacional para linguagens de parsing geradas por gramáticas de adjunção de árvores (TAGs). Ele é similar ao parsing de autômato com pilha para gramática livre de contexto , exceto que ao invés de usar uma simples pilha para armazenar símbolos, ele tem uma pilha de iterações de pilhas que armazena símbolos, dando às TAGs uma capacidade de geração entre gramáticas livres do contexto e gramáticas sensíveis ao contexto, ou um subconjunto de gramáticas levemente sensíveis ao contexto.ramáticas levemente sensíveis ao contexto.
|
| rdfs:label |
Autômato com pilha embutida
, Embedded pushdown automaton
, 嵌入下推自动机
, Automate à piles intégrées
|
