Pseudorandom generators against advised context-free languages
From MaRDI portal
Publication:899305
DOI10.1016/J.TCS.2015.10.026zbMATH Open1333.68175OpenAlexW2962893111MaRDI QIDQ899305FDOQ899305
Publication date: 28 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.026
Recommendations
advicecontext-free languagepushdown automatonpseudorandom generatorpseudorandom languageswapping property
Cites Work
- A taxonomy of complexity classes of functions
- Computational Complexity
- Hardness vs randomness
- Title not available (Why is that?)
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Foundations of Cryptography
- Quantitative Relativizations of Complexity Classes
- The roles of advice to one-tape linear-time Turing machines and finite automata (extended abstract)
- One-way reversible and quantum finite automata with advice
- SOFSEM 2004: Theory and Practice of Computer Science
- Immunity and pseudorandomness of context-free languages
- Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages
Cited In (4)
- Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata
- Random Generation for Finitely Ambiguous Context-free Languages
- One-way reversible and quantum finite automata with advice
- Power of counting by nonuniform families of polynomial-size finite automata
This page was built for publication: Pseudorandom generators against advised context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899305)
