Tree automata and separable sets of input variables
Slavcho Shtrakov, Vladimir Shtrakov
cs.CCarXiv:cs/0702123
Abstract
We consider the computational complexity of tree transducers, depending on their separable sets of input variables.
Create a lesson
Related papers
Marton's conjecture in polynomial time
Srinivasan Arunachalam, Arkopal Dutt, Sabee Grewal et al.
Efficient Randomized Communication Without Large Monochromatic Rectangles
Haoyu Wang, Pei Wu
On the Turing Completeness of Transformers and Agents
Yimu Qiao, Lijia Yu, Ruichen Qiu et al.
Dense Pinwheel Packing Is Strongly NP-Complete
Yusuke Kobayashi, Bingkai Lin, Joseph Swernofsky
A Separation Between Distribution-Free SQ Learning and Dimension Complexity
Shyamal Patel
Almost Optimal FPT Inapproximability for k-SetCover
Venkatesan Guruswami, Xuandi Ren