I am studying LBA (linear bounded automata). Trying to figure it out how to solve some exersise.
So I wonder if there is an easy way to make a LBA given a Context-sensitive grammar.
This is thinking like how you can go from LR grammar to DFA (deterministic finite automata).
thanks in advance