On Bounded Interpretations of Grammar Forms

@article{CsuhajVarj1991OnBI,
  title={On Bounded Interpretations of Grammar Forms},
  author={Erzs{\'e}bet Csuhaj-Varj{\'u} and J{\"u}rgen Dassow},
  journal={Theor. Comput. Sci.},
  year={1991},
  volume={87},
  pages={287-313}
}
1 Citations

Descriptional Complexity of Context-Free Grammar Forms

References

SHOWING 1-7 OF 7 REFERENCES

Context-Free Grammar Forms

Complexity and Unambiguity of Context-Free Grammars and Languages

  • J. Gruska
  • Linguistics, Computer Science
    Inf. Control.
  • 1971

On a classification of context-free languages

The set E of strings is said to be definable (strongly definable) if there is a context-free grammar G such that E is the set of all terminal strings generated from the initial symbol (from all non­

Three theorems of multivariate empirical process

Let x 1 , x 2 ,... be a sequence of independent r.v.'s uniformly distributed over the unit cube I d of the d-dimensional Euclidean Space. Further let F n be the empirical distribution function based

Formal languages

  • A. Salomaa
  • Computer Science
    Computer science classics
  • 1987