Some Decision Problems for BTA's.
Akira Nakamura · Defense Technical Information Center (DTIC) · 1977
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)