Immunity and pseudorandomness of context-free languages
type: Item
instance of: scholarly article
title: Immunity and pseudorandomness of context-free languages
zbMATH Open document ID: 1230.68140
author: Tomoyuki Yamakami
published in: Theoretical Computer Science
publication date: 2012-01-09T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5995834
zbMATH Keywords: context-free languages
zbMATH Keywords: computational complexity
zbMATH Keywords: immunity
zbMATH Keywords: pseudorandomness
zbMATH Keywords: REG
zbMATH Keywords: CFL
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.07.013
OpenAlex ID: W1849715658
cites work: Q4734760
cites work: Resource-bounded balanced genericity, stochasticity and weak randomness
cites work: Computational Complexity
cites work: Q3217603
cites work: Q3996675
cites work: Bi-immune sets for complexity classes
cites work: Q3292904
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Three models for the description of language
cites work: On certain formal properties of grammars
cites work: Some Recursively Unsolvable Problems in ALGOL-Like Languages
cites work: Foundations of Cryptography
cites work: A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
cites work: One-tape, off-line Turing machine computations
cites work: Oracle-dependent properties of the lattice of NP sets
cites work: Q5592246
cites work: Q4506483
cites work: Completeness, Approximation and Density
cites work: On the structure of one-tape nondeterministic Turing machine time hierarchy
cites work: Towards the Actual Relationship Between NP and Exponential Time
cites work: A New Interpretation of the von Mises' Concept of Random Sequence
cites work: A note on balanced immunity
cites work: Recursively enumerable sets of positive integers and their decision problems
cites work: Q5573961
cites work: Immunity, Relativizations, and Nondeterminism
cites work: Theory of one-tape linear-time Turing machines
cites work: Resource bounded immunity and simplicity
DOI: 10.1016/J.TCS.2011.07.013
description: scientific article; zbMATH DE number 5995834