Some Decision Problems for BTA's.

Abstract

In this paper it is proved that the emptiness problem for deterministic bottom-up triangle acceptors (BTA's) is recursively unsolvable. From this result, it is also shown that certain decision problems involving BTA's and BPA's (deterministic bottom-up pyramid acceptors) are unsolvable. (Author)

Document Details

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

Entities

People

  • Akira Nakamura

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Geometry
  • Mathematics
  • Triangles

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.