Single-valuedness of tree transducers is decidable in polynomial time (Q685348)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Single-valuedness of tree transducers is decidable in polynomial time |
scientific article; zbMATH DE number 417313
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-valuedness of tree transducers is decidable in polynomial time |
scientific article; zbMATH DE number 417313 |
Statements
Single-valuedness of tree transducers is decidable in polynomial time (English)
0 references
17 October 1993
0 references
A bottom-up finite-state tree transducer (FST) is a generalization of a generalized sequential machine that outputs a tree while scanning an input tree in a bottom-up fashion. A deterministic polynomial time algorithm is constructed to decide whether a given FST is single-valued. It follows from this result that the equivalence problem of deterministic FSTs can be decided in deterministic polynomial time.
0 references
trees
0 references
tree transducer
0 references
