Immunity, relativizations, and nondeterminism
SIAM Journal on Computing
How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
On the structure of one-tape nondeterministic Turing machine time hierarchy
Theoretical Computer Science
Structural complexity 2
Some Recursively Unsolvable Problems in ALGOL-Like Languages
Journal of the ACM (JACM)
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM (JACM)
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Separating, Strongly Separating, and Collapsing Relativized Complexity Classes
Proceedings of the Mathematical Foundations of Computer Science 1984
On Sets Having Only Hard Subsets
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Diagonalizing over Deterministic Polynomial Time
CSL '87 Proceedings of the 1st Workshop on Computer Science Logic
Resource bounded immunity and simplicity
Theoretical Computer Science
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Randomness and the density of hard problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
One-Way reversible and quantum finite automata with advice
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
The dissecting power of regular languages
Information Processing Letters
| Hi-index | 5.23 |
We discuss the computational complexity of context-free languages, concentrating on two well-known structural properties-immunity and pseudorandomness. An infinite language is REG-immune (resp., CFL-immune) if it contains no infinite subset that is a regular (resp., context-free) language. We prove that (i) there is a context-free REG-immune language outside REG/n and (ii) there is a REG-bi-immune language that can be computed deterministically using logarithmic space. We also show that (iii) there is a CFL-simple set, where a CFL-simple language is an infinite context-free language whose complement is CFL-immune. Similar to the REG-immunity, a REG-primeimmune language has no polynomially dense subsets that are also regular. We further prove that (iv) there is a context-free language that is REG/n-bi-primeimmune. Concerning pseudorandomness of context-free languages, we show that (v) CFL contains REG/n-pseudorandom languages. Finally, we prove that (vi) against REG/n, there exists an almost 1-1 pseudorandom generator computable in nondeterministic pushdown automata equipped with a write-only output tape and (vii) against REG, there is no almost 1-1 weakly pseudorandom generator computable deterministically in linear time by a single-tape Turing machine.