The following pages link to (Q4886090):
Displayed 12 items.
- Generating, sampling and counting subclasses of regular tree languages (Q359886) (← links)
- Uniform random generation of decomposable structures using floating-point arithmetic (Q1292294) (← links)
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- A linear algorithm for the random sampling from regular languages (Q2428675) (← links)
- Evaluation and Enumeration Problems for Regular Path Queries (Q3305367) (← links)
- On Computing the Total Variation Distance of Hidden Markov Models. (Q5002817) (← links)
- Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2 (Q5501618) (← links)
- Transducing Markov sequences (Q5501935) (← links)
- Asymmetric Distances for Approximate Differential Privacy (Q5875371) (← links)
- The Complexity of Aggregates over Extractions by Regular Expressions (Q6135782) (← links)
- Weights of formal languages based on geometric series with an application to automatic grading (Q6144019) (← links)
- Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages (Q6169895) (← links)