ON THE CLOSURE OF AFL UNDER REVERSAL

Abstract

A simple sufficiency condition is given for an abstract family of acceptors (abbreviated AFA) to define an abstract family of languages (abbreviated AFL) which is closed under reversal. This condition is satisfied by all of the well-known AFA which define reversal-closed AFL. A partial converse is given for AFL which are closed under both reversal and intersection with linear context-free languages.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 10, 1969
Accession Number
AD0700816

Entities

People

  • Michael Harrison
  • Seymour Ginsburg

Organizations

  • System Development Corporation

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Automata
  • California
  • Computations
  • Computer Programming
  • Contracts
  • Corporations
  • Data Science
  • Formal Languages
  • Instructions
  • Language
  • Reversible
  • Scientific Research
  • Universities
  • Virginia

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.