Can a 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?

Answer 1

Yes, it is possible to have Linear Bounded Automata for each and every regular languages. Regular languages are proper subset of Context Sensitive Languages. CSL is the language associated with Linear Bounded Automata (LBA). For more information on hierarchy of classes of formal grammars and languages read about Chomsky Hierarchy.

http://en.wikipedia.org/wiki/Chomsky_hierarchy