Accession Number:

ADA050387

Title:

Some Decision Problems for BTA's.

Descriptive Note:

Interim rept.,

Corporate Author:

MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER

Personal Author(s):

Report Date:

1977-12-01

Pagination or Media Count:

14.0

Abstract:

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

Subject Categories:

  • Numerical Mathematics
  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE