Tree automata and separable sets of input variables

Authors

Shtrakov, Slavcho

Shtrakov, Vladimir

Description

We consider the computational complexity of tree transducers, depending on their separable sets of input variables.
8 pages, 2 figures

Keywords

Computational Complexity, Discrete Mathematics, F.1.1; F.1.3

URI

http://salesiana.dossiersoluciones.com/handle/123456789/124495

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0702123
http://arxiv.org/abs/cs/0702123
J. FILOMAT, v. 15, 2001, University of Nis, 61-71 p., ISSN 0354-5180 (http://www.pmf.ni.ac.yu/sajt/publikacije/filomat_15.html)

Collections