TAPE- AND TIME-BOUNDED TURING ACCEPTORS AND AFLs,

Abstract

Complexity classes of formal languages defined by time- and tape-bounded Turing acceptors are studied with the aim of showing sufficient conditions for these classes to be AFLs and to be principal AFLs. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1970
Accession Number
AD0712704

Entities

People

  • Ben Wegbreit
  • Ronald Book
  • Shelia Greibach

Organizations

  • Harvard University

Tags

DTIC Thesaurus Topics

  • Formal Languages

Readers

  • Mathematical Modeling and Probability Theory.