scientific article; zbMATH DE number 910913
From MaRDI portal
Publication:4886090
zbMath0855.68050MaRDI QIDQ4886090
Steve Mahaney, Z. Sweedyk, Sampath Kannan
Publication date: 14 January 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
A quasi-polynomial-time algorithm for sampling words from a context-free language ⋮ Generating, sampling and counting subclasses of regular tree languages ⋮ Evaluation and Enumeration Problems for Regular Path Queries ⋮ The Complexity of Aggregates over Extractions by Regular Expressions ⋮ Weights of formal languages based on geometric series with an application to automatic grading ⋮ Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages ⋮ A linear algorithm for the random sampling from regular languages ⋮ On Computing the Total Variation Distance of Hidden Markov Models. ⋮ Asymmetric Distances for Approximate Differential Privacy ⋮ Uniform random generation of decomposable structures using floating-point arithmetic ⋮ Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2 ⋮ Transducing Markov sequences
This page was built for publication:
