Add to ORKGnew dichotomic algorithm for the uniform random generation of words in regular language
Motzkin trees are also called unary-binary trees. This paper proposes a linear algorithm for uniform...
International audienceThe present work analyzes the redundancy of sets of combinatorial objects prod...
Let A X* be a regular language. In the paper, we will provide an algorithm to decide whether there ...
International audienceWe present a new algorithm for generating uniformly at random words of any reg...
International audienceGeneralizing an idea used by Alonso to generate uniformly at random Motzkin wo...
We show that, for every unambiguous context-free language L, a uniform random word of length n in L ...
International audienceThe paper studies the behaviour of selection algorithms that are based on dich...
We prove that a word of length n from a finitely ambiguous context-free language can be generated at...
Algorithmic generation of random languages argues for syntax as a source of phylogenetic informatio
We study the circuit complexity of generating at random a word of length n from a given language und...
In simulations, probabilistic algorithms and statistical tests, we often generate random integers in...
We prove that a word of length n from a finitely ambiguous context-free language can be generated a...
Abstract. We address the non-redundant random generation of k words of length n from a context-free ...
AbstractA quasi-polynomial-time algorithm is presented for sampling almost uniformly at random from ...
Motzkin trees are also called unary-binary trees. This paper proposes a linear algorithm for uniform...
International audienceThe present work analyzes the redundancy of sets of combinatorial objects prod...
Let A X* be a regular language. In the paper, we will provide an algorithm to decide whether there ...
International audienceWe present a new algorithm for generating uniformly at random words of any reg...
International audienceGeneralizing an idea used by Alonso to generate uniformly at random Motzkin wo...
We show that, for every unambiguous context-free language L, a uniform random word of length n in L ...
International audienceThe paper studies the behaviour of selection algorithms that are based on dich...
We prove that a word of length n from a finitely ambiguous context-free language can be generated at...
Algorithmic generation of random languages argues for syntax as a source of phylogenetic informatio
We study the circuit complexity of generating at random a word of length n from a given language und...
In simulations, probabilistic algorithms and statistical tests, we often generate random integers in...
We prove that a word of length n from a finitely ambiguous context-free language can be generated a...
Abstract. We address the non-redundant random generation of k words of length n from a context-free ...
AbstractA quasi-polynomial-time algorithm is presented for sampling almost uniformly at random from ...
Motzkin trees are also called unary-binary trees. This paper proposes a linear algorithm for uniform...
International audienceThe present work analyzes the redundancy of sets of combinatorial objects prod...
Let A X* be a regular language. In the paper, we will provide an algorithm to decide whether there ...