About: Tree transducer

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Tree transducer Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/AXiXgmoM3R

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:

Attributes	Values
rdfs:label	Tree transducer (en)
rdfs:comment	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: (en)
dct:subject	Finite automata Theoretical computer science Automata (computation) Formal languages Trees (data structures)
Wikipage page ID	54423048 (xsd:integer)
Wikipage revision ID	1067744422 (xsd:integer)
Link from a Wikipage to another Wikipage	Binary relation Function composition Equivalence problem Closure (mathematics) Computational complexity theory Partial function Theoretical computer science Tree (automata theory) Domain of a function Finite automata Finite-state automata Finite-state transducer Finite set Formal language theory Formal language Restriction (mathematics) Theoretical computer science Abstract machine Automata (computation) Formal languages Trees (data structures) Term rewriting system Identity (mathematics) Ranked alphabet Semantics (computer science) Image (mathematics) Subset Tree automata Regular tree language Nullary Union (mathematics) Typechecking dbr:Lookahead_(tree_transducer)
Link from a Wikipage to an external page	https://hal.inria.fr/hal-03367725/document%7C
sameAs	Tree transducer Tree transducer
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Reflist dbt:Harvid
has abstract	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: (en)
prov:wasDerivedFrom	wikipedia-en:Tree_transducer?oldid=1067744422&ns=0
page length (characters) of wiki page	9665 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Tree_transducer
is Link from a Wikipage to another Wikipage of	Finite-state transducer List of terms relating to algorithms and data structures Tree transducers
is Wikipage redirect of	Tree transducers
is foaf:primaryTopic of	wikipedia-en:Tree_transducer

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3332 as of Dec 5 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software