Some Decision Problems for BTA's.
MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER
Pagination or Media Count:
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
- Numerical Mathematics
- Operations Research