Results 1  10
of
2,856
Implementing Regular Tree Expressions
 In Proceedings of the 1991 Conference on Functional Programming Languages and Computer Architecture
, 1991
"... Regular tree expressions are a natural formalism for describing the sets of treestructured values that commonly arise in programs; thus, they are wellsuited to applications in program analysis. We describe an implementation of regular tree expressions and our experience with that implementation in ..."
Abstract

Cited by 59 (7 self)
 Add to MetaCart
Regular tree expressions are a natural formalism for describing the sets of treestructured values that commonly arise in programs; thus, they are wellsuited to applications in program analysis. We describe an implementation of regular tree expressions and our experience with that implementation
Exploring the regular tree types
 In Types for Proofs and Programs
, 2004
"... Abstract. In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic decision procedure for Epigram’s inbuilt equality at each type, taking a complementary approach to that of Benke, Dyb ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
Abstract. In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic decision procedure for Epigram’s inbuilt equality at each type, taking a complementary approach to that of Benke
Taxonomies of regular tree algorithms
"... Abstract. Algorithms for acceptance, pattern matching and parsing of regular trees and the tree automata used in these algorithms have many applications, including instruction selection in compilers, implementation of term rewriting systems, and model checking. Many such tree algorithms and constru ..."
Abstract
 Add to MetaCart
Abstract. Algorithms for acceptance, pattern matching and parsing of regular trees and the tree automata used in these algorithms have many applications, including instruction selection in compilers, implementation of term rewriting systems, and model checking. Many such tree algorithms
Gaussian Waves on the Regular Tree
, 907
"... Abstract. We consider the family of real (generalized) eigenfunctions of the adjacency operator on Td the dregular tree. We show the existence of a unique invariant Gaussian process on the ensemble and derive explicitly its covariance operator. We investigate the typical structure of level sets of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We consider the family of real (generalized) eigenfunctions of the adjacency operator on Td the dregular tree. We show the existence of a unique invariant Gaussian process on the ensemble and derive explicitly its covariance operator. We investigate the typical structure of level sets
Invasion percolation on regular trees
, 2006
"... We consider invasion percolation on a rooted regular tree. For the infinite cluster invaded from the root, we identify the scaling behaviour of its rpoint function for any r ≥ 2 and of its volume both at a given height and below a given height. In addition, we derive scaling estimates for simple ra ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
We consider invasion percolation on a rooted regular tree. For the infinite cluster invaded from the root, we identify the scaling behaviour of its rpoint function for any r ≥ 2 and of its volume both at a given height and below a given height. In addition, we derive scaling estimates for simple
Reconstruction thresholds on regular trees
 in DMTCS volume Proc. Discrete Random Walks
, 2003
"... We consider the model of broadcasting on a tree, with binary state space, on the infinite rooted tree k in which each node has k children. The root of the tree takes a random value 0 or 1, and then each node passes a value independently to each of its children according to a 2 ¡ 2 transition matri ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
and in the special case p11 £ 0. The latter case is closely related to the hardcore model from statistical physics; a corollary of our results is that, for the hardcore model on the ¤ k ¥ 1 ¦regular tree with activity λ £ 1, the unique simple invariant Gibbs measure is extremal in the set of Gibbs measures
Regular Tree Model Checking
"... In this paper, we present an approach for algorithmic verification of infinitestate systems with a parameterized tree topology. Our work is a generalization of regular model checking, where we extend the work done with strings toward trees. States are represented by trees over a finite alphabet, an ..."
Abstract

Cited by 49 (8 self)
 Add to MetaCart
In this paper, we present an approach for algorithmic verification of infinitestate systems with a parameterized tree topology. Our work is a generalization of regular model checking, where we extend the work done with strings toward trees. States are represented by trees over a finite alphabet
Regular trees in random regular graphs
, 2008
"... We investigate the size of the embedded regular tree rooted at a vertex in a d regular random graph. We show that almost always, the radius of this tree will be 1 2 log n, where n is the number of vertices in the graph. And we give an asymptotic estimate for Gauss’ Hypergeometric Function. 1 ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We investigate the size of the embedded regular tree rooted at a vertex in a d regular random graph. We show that almost always, the radius of this tree will be 1 2 log n, where n is the number of vertices in the graph. And we give an asymptotic estimate for Gauss’ Hypergeometric Function. 1
Invasion percolation on regular trees
"... Abstract We consider invasion percolation on a rooted regular tree. For the infinite cluster invaded from the root, we identify the scaling behaviour of its rpoint function for any r ≥ 2 and of its volume both at a given height and below a given height. In addition, we derive scaling estimates for ..."
Abstract
 Add to MetaCart
Abstract We consider invasion percolation on a rooted regular tree. For the infinite cluster invaded from the root, we identify the scaling behaviour of its rpoint function for any r ≥ 2 and of its volume both at a given height and below a given height. In addition, we derive scaling estimates
Property testing of regular tree languages
 IN PROCEEDINGS OF 31ST INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING
, 2004
"... We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and generalize it to the class of ranked regular trees. In the complete version of the paper, we show that the distance problem ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and generalize it to the class of ranked regular trees. In the complete version of the paper, we show that the distance
Results 1  10
of
2,856