| dbo:abstract |
In theoretical computer science and formal language theory, a regular tree grammar is a formal grammar that describes a set of directed trees, or terms. A regular word grammar can be seen as a special kind of regular tree grammar, describing a set of single-path trees. (en) Em informática teórica e teoria das linguagens formais, uma gramática de árvore regular (RTG) é uma gramática formal que descreve o conjunto de árvores direcionais, ou termos. A gramática regular pode ser vista como um tipo especial de gramática de árvore regular, descrevendo um conjunto de árvores de caminho único. (pt) |
| dbo:thumbnail |
wiki-commons:Special:FilePath/Example_derivation_tr...egular_tree_grammar_svg.svg?width=300 |
| dbo:wikiPageID |
5078522 (xsd:integer) |
| dbo:wikiPageLength |
11919 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
1059756091 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Set_constraint dbr:Constraint_satisfaction_problem dbr:Arity dbr:Standard_ML dbr:Derivation_tree dbr:Path_(graph_theory) dbr:Theoretical_computer_science dbr:Tree-adjoining_grammar dbr:Tree_(graph_theory) dbr:Tree_automaton dbr:First-order_logic dbr:Formal_language_theory dbr:Formal_grammar dbr:Formal_language dbr:Term_(logic) dbc:Formal_languages dbr:Code_generation_(compiler) dbr:Term_algebra dbr:Theory_(mathematical_logic) dbr:Dijkstra's_algorithm dbr:Donald_Knuth dbr:Ranked_alphabet dbr:Set_(mathematics) dbr:Nested_word dbr:Regular_grammar dbr:Tree_language dbr:Visibly_pushdown_language dbr:Decision_procedure dbr:File:Example_derivation_tree_of_a_term_from_a_regular_tree_grammar_svg.svg |
| dbp:wikiPageUsesTemplate |
dbt:Cite_book dbt:Cite_conference dbt:Cite_journal dbt:Reflist dbt:Formal_languages_and_grammars |
| dct:subject |
dbc:Formal_languages |
| gold:hypernym |
dbr:Grammar |
| rdf:type |
yago:Abstraction100002137 yago:Communication100033020 yago:Language106282651 dbo:Book yago:WikicatFormalLanguages |
| rdfs:comment |
In theoretical computer science and formal language theory, a regular tree grammar is a formal grammar that describes a set of directed trees, or terms. A regular word grammar can be seen as a special kind of regular tree grammar, describing a set of single-path trees. (en) Em informática teórica e teoria das linguagens formais, uma gramática de árvore regular (RTG) é uma gramática formal que descreve o conjunto de árvores direcionais, ou termos. A gramática regular pode ser vista como um tipo especial de gramática de árvore regular, descrevendo um conjunto de árvores de caminho único. (pt) |
| rdfs:label |
Regular tree grammar (en) Gramática de árvore regular (pt) |
| owl:sameAs |
freebase:Regular tree grammar yago-res:Regular tree grammar wikidata:Regular tree grammar dbpedia-fa:Regular tree grammar dbpedia-pt:Regular tree grammar https://global.dbpedia.org/id/4u88E |
| prov:wasDerivedFrom |
wikipedia-en:Regular_tree_grammar?oldid=1059756091&ns=0 |
| foaf:depiction |
wiki-commons:Special:FilePath/Example_derivation_tr...m_from_a_regular_tree_grammar_svg.svg |
| foaf:isPrimaryTopicOf |
wikipedia-en:Regular_tree_grammar |
| is dbo:wikiPageDisambiguates of |
dbr:RTG dbr:Regular |
| is dbo:wikiPageRedirects of |
dbr:Regular_tree dbr:Regular_tree_language |
| is dbo:wikiPageWikiLink of |
dbr:Set_constraint dbr:Regular_expression dbr:Index_of_philosophy_articles_(R–Z) dbr:Context-free_grammar dbr:Tree_automaton dbr:RTG dbr:Regular dbr:Regular_grammar dbr:Regular_tree dbr:Regular_tree_language |
| is foaf:primaryTopic of |
wikipedia-en:Regular_tree_grammar |
