| http://dbpedia.org/ontology/abstract
|
In theoretical computer science and formal … In theoretical computer science and formal language theory, a tree transducer (TT) is an abstract machine taking as input a tree, and generating output – generally other trees, but models producing words or other structures exist. Roughly speaking, tree transducers extend tree automata in the same way that word transducers extend word automata. Manipulating tree structures instead of words enable TT to model syntax-directed transformations of formal or natural languages. However, TT are not as well-behaved as their word counterparts in terms of algorithmic complexity, closure properties, etcetera. In particular, most of the main classes are not closed under composition. The main classes of tree transducers are: The main classes of tree transducers are:
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://hal.inria.fr/hal-03367725/document%7C +
|
| http://dbpedia.org/ontology/wikiPageID
|
54423048
|
| http://dbpedia.org/ontology/wikiPageLength
|
9665
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1067744422
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Formal_language +
, http://dbpedia.org/resource/Category:Theoretical_computer_science +
, http://dbpedia.org/resource/Regular_tree_language +
, http://dbpedia.org/resource/Closure_%28mathematics%29 +
, http://dbpedia.org/resource/Finite-state_transducer +
, http://dbpedia.org/resource/Domain_of_a_function +
, http://dbpedia.org/resource/Nullary +
, http://dbpedia.org/resource/Equivalence_problem +
, http://dbpedia.org/resource/Finite-state_automata +
, http://dbpedia.org/resource/Term_rewriting_system +
, http://dbpedia.org/resource/Semantics_%28computer_science%29 +
, http://dbpedia.org/resource/Union_%28mathematics%29 +
, http://dbpedia.org/resource/Function_composition +
, http://dbpedia.org/resource/Identity_%28mathematics%29 +
, http://dbpedia.org/resource/Partial_function +
, http://dbpedia.org/resource/Finite_set +
, http://dbpedia.org/resource/Subset +
, http://dbpedia.org/resource/Category:Formal_languages +
, http://dbpedia.org/resource/Category:Automata_%28computation%29 +
, http://dbpedia.org/resource/Computational_complexity_theory +
, http://dbpedia.org/resource/Theoretical_computer_science +
, http://dbpedia.org/resource/Tree_%28automata_theory%29 +
, http://dbpedia.org/resource/Abstract_machine +
, http://dbpedia.org/resource/Formal_language_theory +
, http://dbpedia.org/resource/Tree_automata +
, http://dbpedia.org/resource/Restriction_%28mathematics%29 +
, http://dbpedia.org/resource/Ranked_alphabet +
, http://dbpedia.org/resource/Typechecking +
, http://dbpedia.org/resource/Category:Finite_automata +
, http://dbpedia.org/resource/Lookahead_%28tree_transducer%29 +
, http://dbpedia.org/resource/Binary_relation +
, http://dbpedia.org/resource/Category:Trees_%28data_structures%29 +
, http://dbpedia.org/resource/Image_%28mathematics%29 +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Harvid +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Cite_book +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Finite_automata +
, http://dbpedia.org/resource/Category:Formal_languages +
, http://dbpedia.org/resource/Category:Theoretical_computer_science +
, http://dbpedia.org/resource/Category:Trees_%28data_structures%29 +
, http://dbpedia.org/resource/Category:Automata_%28computation%29 +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Tree_transducer?oldid=1067744422&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Tree_transducer +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q42417196 +
, http://dbpedia.org/resource/Tree_transducer +
, https://global.dbpedia.org/id/3voPA +
|
| rdfs:comment |
In theoretical computer science and formal … In theoretical computer science and formal language theory, a tree transducer (TT) is an abstract machine taking as input a tree, and generating output – generally other trees, but models producing words or other structures exist. Roughly speaking, tree transducers extend tree automata in the same way that word transducers extend word automata. The main classes of tree transducers are: The main classes of tree transducers are:
|
| rdfs:label |
Tree transducer
|
