Nondeterministic Bottom-up Pyramid Acceptors.

Abstract

Several properties and capabilities of nondeterministic bottom-up pyramid cellular acceptors (NBPA's) are presented. NBPA's are a special case of the pyramid cellular acceptors. The main result is that the class of languages accepted by nondeterministic bounded cellular array acceptors is the same as that accepted by NBPA's.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1977
Accession Number
ADA050466

Entities

People

  • Akira Nakamura
  • Charles R. Dyer

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Acceptability
  • Air Force
  • Automata
  • Computer Science
  • Diameters
  • Formal Languages
  • Language
  • Machines
  • Maryland
  • Recognition
  • Sequences
  • Standards
  • Transitions
  • Two Dimensional
  • Universities

Readers

  • Computational Linguistics
  • Explosive Engineering.
  • Nanocomposite Materials Science