Are there decidable non-trivial properties of a LBA's accepted language?
Given a Turing machine $M$, you can construct an LBA $A$ that given as input a word of length $n$, it simulates $M$ on the empty tape as long as $M$ uses up to $n$ space, and the moment $M$ exceeds space $n$, it enters an infinite loop. In contrast, if $M$ ever halts, then $A$ also halts. Thus $A$ halts on some input iff $M$ halts on the empty input.
You can try to show that the second property is undecidable using a similar argument.