Tree automata and separable sets of input variables

Simple item page
dc.creatorShtrakov, Slavcho
dc.creatorShtrakov, Vladimir
dc.date2007-02-22
dc.date.accessioned2026-07-07T07:48:25Z
dc.date.available2026-07-07T07:48:25Z
dc.descriptionWe consider the computational complexity of tree transducers, depending on their separable sets of input variables.
dc.description8 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/cs/0702123
dc.identifierhttp://arxiv.org/abs/cs/0702123
dc.identifierJ. FILOMAT, v. 15, 2001, University of Nis, 61-71 p., ISSN 0354-5180 (http://www.pmf.ni.ac.yu/sajt/publikacije/filomat_15.html)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124495
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectF.1.1; F.1.3
dc.titleTree automata and separable sets of input variables
dc.typetext

Files

Collections

arXiv