Can every regular language have a linear bounded automaton

Question

As the question states:

I am trying to understand automata. Can every regular language have a linear bounded automaton?

score 1 · Accepted Answer · answered Mar 30 '13 at 23:07

1

Yes: linear bounded automata are acceptors for context-sensitive languages, and regular languages are context-sensitive.

answered Mar 30 '13 at 23:07

Brian M. Scott

1 Answers1