10.5.1 Explain how linear bounded automata could be constructed to accept the following languages:
(a)L= { a2 :n=m2,m≥1}
(explanation is much appreciated)
Given language is L= { a2 :n=m2,m≥1} here n is equal to m2 we can write a2 into m blocks of length m.
Linear Bounded automata can give m and it tests the input of the language a^m^2 by the block of length m exactly m-1 times.
In Linear Bounded Automata if the result is equal to the given input then the language is accepted
Without Non determinism we can give input if it reaches to the length of the input then it is accepted, if the given input is more than the length then it is rejected.
Get Answers For Free
Most questions answered within 1 hours.