• Corpus ID: 31110556

On sets generated by context-free grammars

@article{Gruska1966OnSG,
  title={On sets generated by context-free grammars},
  author={Jozef Gruska},
  journal={Kybernetika},
  year={1966},
  volume={2},
  pages={483-493}
}
  • J. Gruska
  • Published 1966
  • Computer Science
  • Kybernetika
1 Citations

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­

References

SHOWING 1-3 OF 3 REFERENCES

Semantics and translation of grammars and ALGOL-like languages

On formal properties of simple phrase structure grammars

  • Tech. Rep. No
  • 1960

On certain Properties of Grammars

  • Information and Control
  • 1959