Computer Science – Computational Complexity
Scientific paper
2007-02-22
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
Computer Science
Computational Complexity
8 pages, 2 figures
Scientific paper
We consider the computational complexity of tree transducers, depending on
their separable sets of input variables.
Shtrakov Slavcho
Shtrakov Vladimir
No associations
LandOfFree
Tree automata and separable sets of input variables does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Tree automata and separable sets of input variables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree automata and separable sets of input variables will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-101972