scientific article; zbMATH DE number 910913
From MaRDI portal
zbMATH Open0855.68050MaRDI QIDQ4886090FDOQ4886090
Authors: Sampath Kannan, Z. Sweedyk, Steve Mahaney 
Publication date: 14 January 1997
Title of this publication is not available (Why is that?)
Recommendations
Cited In (21)
- A new dichotomic algorithm for the uniform random generation of words in regular languages
- The Complexity of Aggregates over Extractions by Regular Expressions
- Title not available (Why is that?)
- 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
- Evaluation and enumeration problems for regular path queries
- Uniform random generation of decomposable structures using floating-point arithmetic
- On String Languages Generated by Sequential Numerical P Systems
- Title not available (Why is that?)
- Stochastic analysis of minimal automata growth for generalized strings
- On the complexity of the string generation problem
- A linear algorithm for the random sampling from regular languages
- Counting with range concatenation grammars
- Shuffling biological sequences with motif constraints
- Counting regular expressions in degenerated sequences through lazy Markov chain embedding
- On computing the total variation distance of hidden Markov models
- Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages
- Complexity of conjugacy, factoring and embedding for countable sofic shifts of rank 2
- A quasi-polynomial-time algorithm for sampling words from a context-free language
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)
