A note on Undecidable Properties of Formal Languages

Abstract

A general set of conditions is given under which a property is undecidable for a family of languages. Examples are given of the application of this result to well-known families of languages.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 28, 1967
Accession Number
AD0661968

Entities

People

  • Sheila Greibach

Organizations

  • System Development Corporation

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Automata
  • Classification
  • Commerce
  • Contractors
  • Contracts
  • Data Science
  • Formal Languages
  • Grammars
  • Language
  • Linguistics
  • Machines
  • Recursive Functions
  • Security
  • United States