Searching for "On Computable Tree Functions." – sorted by Relevance.
-
The Universality of Higher-Order Attributed Tree Transducers
- : their computational power is characterized by the class of partial recursive tree functions. The latter is defined
- Cited by 2 (1 self) – Add To MetaCart
-
Verifying concurrent systems with symbolic execution
- trees. Functions A resp. E (see Fig. 7) generalize the formulas in the antecedent resp. succedent
- Cited by 23 (16 self) – Add To MetaCart
-
Coarse Grained Parallel Graph Planarity Testing
- can be done using using Euler Tour technique for computing tree functions [3]. Thus the CGM st
- Cited by 3 (1 self) – Add To MetaCart
-
Relativization of the Theory of Computational Complexity
- be carried out as follows: Generate a "computation tree" for the function f(xl,...,Xk,A) as A ranges over
- Cited by 11 (4 self) – Add To MetaCart
-
Computing the Hough Transform on a Scan Line Array Processor
- biconnected components and computing tree functions in logarithmic parallel time,’’ in Proc. 25th Annu. Symp
- Add To MetaCart

