scientific article; zbMATH DE number 910913

zbMATH Open0855.68050MaRDI QIDQ4886090FDOQ4886090

Steve Mahaney, Z. Sweedyk, Sampath Kannan

Publication date: 14 January 1997

Title of this publication is not available (Why is that?)

zbMATH Keywords

regular languagesrandom generation of strings

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited In (14)

• The Complexity of Aggregates over Extractions by Regular Expressions
• Weights of formal languages based on geometric series with an application to automatic grading
• Transducing Markov sequences
• Generating, sampling and counting subclasses of regular tree languages
• Asymmetric Distances for Approximate Differential Privacy
• Uniform random generation of decomposable structures using floating-point arithmetic
• On String Languages Generated by Sequential Numerical P Systems
• Evaluation and Enumeration Problems for Regular Path Queries
• On Computing the Total Variation Distance of Hidden Markov Models.
• Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2
• A linear algorithm for the random sampling from regular languages
• Counting with range concatenation grammars
• Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages
• A quasi-polynomial-time algorithm for sampling words from a context-free language

Recommendations

• Motif statistics. 👍 👎
• Uniform random generation of words of rational languages 👍 👎
• A linear algorithm for the random sampling from regular languages 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886090)