QUOTIENTS OF CONTEXT FREE LANGUAGES

Abstract

The following results on the quotient of context free languages CFL are shown: (1) It is recursively unsolvable to determine for arbitrary CFL whether the quotient of one by another is a CFL. (2) If either set is regular and the other is a CFL, then the quotient is a CFL. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 09, 1962
Accession Number
AD0284383

Entities

People

  • Edwin H. Spanier
  • Seymour Ginsburg

Organizations

  • System Development Corporation

Tags

DTIC Thesaurus Topics

  • Language

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Tactical Satellite Communications Systems Engineering.