An FPRAS and Polynomial-Time Uniform Sampler for Tree Automata

    Arenas Marcelo
    Arenas Marcelo
    Croquevielle Luis Alberto
    Croquevielle Luis Alberto
    Jayaram Rajesh
    Jayaram Rajesh
    Cited by: 0|Bibtex|Views7|Links

    Abstract:

    In this work, we introduce the first fully polynomial time randomized approximation scheme (FPRAS) for counting the number of trees of size $n$ accepted by a tree automaton, where $n$ is given in unary, and the first polynomial time algorithm for sampling uniformly from this set of trees. Our results improve over the prior quasi-polynom...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments