Tree-to-tree Hennie machines compute functions with linear size-to-height increase that lie between LSHI macro tree transducers and MSO set interpretations, are closed under specific compositions, contain the strict linear-height MTT composition hierarchy, and are equivalently characterized by a lin
The structure of polynomial growth for tree automata/transducers and mso set queries
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A theorem establishes that MSO queries on strings with O(n0 * n1) results can be reparameterized to identify each result from one 0-position, one 1-position and finite data, with the result extending to FO logic.
citing papers explorer
-
Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic)
Tree-to-tree Hennie machines compute functions with linear size-to-height increase that lie between LSHI macro tree transducers and MSO set interpretations, are closed under specific compositions, contain the strict linear-height MTT composition hierarchy, and are equivalently characterized by a lin
-
A finer reparameterisation theorem for MSO and FO queries on strings
A theorem establishes that MSO queries on strings with O(n0 * n1) results can be reparameterized to identify each result from one 0-position, one 1-position and finite data, with the result extending to FO logic.