On the public citation graph
Uniform Random Generation of Strings in a Context-Free Language
0 signed · 59 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0020-0190(77)90020-5openalex-snapshot
Automatic solution of a certain class of combinatorial problems
inferredcites →https://doi.org/10.1145/322307.322316openalex-snapshot
Upper Bounds for Speedup in Parallel Parsing
inferredcites →https://doi.org/10.1145/356827.356829openalex-snapshot
Probabilistic Languages: A Review and Some Open Questions
inferredcites →https://doi.org/10.1145/357084.357091openalex-snapshot
Uniform Random Generation of Balanced Parenthesis Strings
inferredcites →https://doi.org/10.1145/359511.359517openalex-snapshot
Analyses of deterministic parsing algorithms
inferredcites →https://doi.org/10.5860/choice.26-3305openalex-snapshot
An introduction to formal language theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/stvr.1526openalex-snapshot
A random testing approach using pushdown automata
inferred← citeshttps://doi.org/10.1006/inco.1997.2621openalex-snapshot
A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_27openalex-snapshot
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_47openalex-snapshot
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_71openalex-snapshot
Directed column-convex polyominoes by recurrence relations
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_53openalex-snapshot
A calculus of random generation
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_26openalex-snapshot
Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation
inferred← citeshttps://doi.org/10.1007/978-3-0348-8405-1_10openalex-snapshot
Random generation of words of context-free languages according to the frequencies of letters
inferred← citeshttps://doi.org/10.1007/978-3-642-19811-3_10openalex-snapshot
Uniform Monte-Carlo Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-21768-5_10openalex-snapshot
A Random Testing Approach Using Pushdown Automata
inferred← citeshttps://doi.org/10.1007/bf02242022openalex-snapshot
Uniform random generation of expressions respecting algebraic identities
inferred← citeshttps://doi.org/10.1007/s00453-010-9446-5openalex-snapshot
A Linear Algorithm for the Random Sampling from Regular Languages
inferred← citeshttps://doi.org/10.1007/s42484-021-00041-1openalex-snapshot
A quantum search decoder for natural language processing
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00121-xopenalex-snapshot
The random generation of underdiagonal walks
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00129-kopenalex-snapshot
Génération aléatoire et uniforme de mots
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00054-9openalex-snapshot
Uniform generation of forests of restricted height
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90033-7openalex-snapshot
Generating words in a context-free language uniformly at random
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00025-8openalex-snapshot
Random generation of words in an algebraic language in linear binary space
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90011-9openalex-snapshot
Analytic models and ambiguity of context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90145-ropenalex-snapshot
Automatic average-case analysis of algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90304-copenalex-snapshot
Animaux et arbres guingois
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90226-7openalex-snapshot
A calculus for the random generation of labelled combinatorial structures
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00200-6openalex-snapshot
Génération aléatoire uniforme de mots de langages rationnels
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.11.009openalex-snapshot
Path computation in multi-layer multi-domain networks: A language theoretic approach
inferred← citeshttps://doi.org/10.1016/j.dam.2007.07.003openalex-snapshot
Hybrid one-dimensional reversible cellular automata are regular
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.021openalex-snapshot
Linear delay enumeration and monadic second-order logic
inferred← citeshttps://doi.org/10.1016/j.jsc.2021.08.003openalex-snapshot
Simplifying regular expressions further
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.025openalex-snapshot
A new dichotomic algorithm for the uniform random generation of words in regular languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00322-3openalex-snapshot
Random generation of trees and other combinatorial objects
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00323-5openalex-snapshot
Uniform random generation of decomposable structures using floating-point arithmetic
inferred← citeshttps://doi.org/10.1017/s0963548314000728openalex-snapshot
Formulae and Asymptotics for Coefficients of Algebraic Functions
inferred← citeshttps://doi.org/10.1051/ita:2001128openalex-snapshot
Random Generation for Finitely Ambiguous Context-free Languages
inferred← citeshttps://doi.org/10.1080/00207169808804677openalex-snapshot
Ranking and unranking left szilard languages
inferred← citeshttps://doi.org/10.1093/comjnl/bxy110openalex-snapshot
Towards an Effective Syntax and a Generator for Deterministic Standard Regular Expressions
inferred← citeshttps://doi.org/10.1093/comjnl/bxy137openalex-snapshot
String Generation for Testing Regular Expressions
inferred← citeshttps://doi.org/10.1109/ase.2001.989785openalex-snapshot
A new way of automating statistical testing methods
inferred← citeshttps://doi.org/10.1109/bibe.2004.1317369openalex-snapshot
Estimating seed sensitivity on homogeneous alignments
inferred← citeshttps://doi.org/10.1109/icst.2011.31openalex-snapshot
Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing
inferred← citeshttps://doi.org/10.1109/icstw.2013.32openalex-snapshot
Random Grammar-Based Testing for Covering All Non-terminals
inferred← citeshttps://doi.org/10.1109/icstw.2015.7107406openalex-snapshot
Covering both stack and states while testing push-down systems
inferred← citeshttps://doi.org/10.1109/issre.2004.2openalex-snapshot
A Generic Method for Statistical Testing
inferred← citeshttps://doi.org/10.1109/tse.1985.231848openalex-snapshot
Estimating the Speedup in Parallel Parsing
inferred← citeshttps://doi.org/10.1137/090766632openalex-snapshot
Simulating Size-constrained Galton–Watson Trees
inferred← citeshttps://doi.org/10.1145/1145735.1145738openalex-snapshot
Uniform random sampling of traces in very large models
inferred← citeshttps://doi.org/10.1145/2814270.2814304openalex-snapshot
Automating grammar comparison
inferred← citeshttps://doi.org/10.1145/2858965.2814304openalex-snapshot
Automating grammar comparison
inferred← citeshttps://doi.org/10.1145/3650212.3685553openalex-snapshot
Shaping Test Inputs in Grammar-Based Fuzzing
inferred← citeshttps://doi.org/10.15607/rss.2021.xvii.051openalex-snapshot
Entropy-Guided Control Improvisation
inferred← citeshttps://doi.org/10.17863/cam.69228openalex-snapshot
A quantum search decoder for natural language processing
inferred← citeshttps://doi.org/10.23638/dmtcs-19-1-23openalex-snapshot
Lattice paths with catastrophes
inferred← citeshttps://doi.org/10.46298/dmtcs.250openalex-snapshot
Object grammars and random generation
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0606086openalex-snapshot
Uniform Random Sampling of Traces in Very Large Models
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.