Register

Peter Linz Edition 5 Exercise 10.5 Question 5 (Page No. 276)

• edited by
136 views
0 votes
0 votes
$\text{Example}:$ Find a linear bounded automaton that accepts the language

                                                                                  $L = \{a^{n!}:n\geq0\}$.

Find a lba for the complement of the language in Example, assuming that $\Sigma = \{a,b\}$.
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Rishi yadav asked Apr 3, 2019
203 views
Peter Linz Edition 5 Exercise 10.5 Question 6,7 (Page No. 276)
$\text{Exercise}:6$ ... above exercise to show that any context-free language not containing $\lambda$ is accepted by some linear bounded automaton.
$\text{Exercise}:6$ Show that for every context-free language there exists an accepting pda, such that the number of symbols in the stack never exceeds the length of the...
User Avatar
0 votes
0 votes
0 answers
2
Rishi yadav asked Apr 3, 2019
179 views
Peter Linz Edition 5 Exercise 10.5 Question 4(f) (Page No. 276)
Find linear bounded automata for the following languages. $L =\Big \{www^R:w\in \{a,b\}^+\Big\}$.
Find linear bounded automata for the following languages. $L =\Big \{www^R:w\in \{a,b\}^+\Big\}$.
User Avatar
0 votes
0 votes
0 answers
3
Rishi yadav asked Apr 3, 2019
126 views
Peter Linz Edition 5 Exercise 10.5 Question 4(e) (Page No. 276)
Find linear bounded automata for the following languages. $L = \Big\{w^n : w\in\{a,b\}^+,n\geq2\Big\}$.
Find linear bounded automata for the following languages. $L = \Big\{w^n : w\in\{a,b\}^+,n\geq2\Big\}$.
User Avatar
Link Copied!