Akira Nakamura, MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER.
Some Decision Problems for BTA's

Some Decision Problems for BTA's

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).
Sign up to use