Register

Regular Language Automata

• edited by
342 views

1 Answer

Best answer
1 votes
1 votes
A is the answer language 1 and 2 both are regular as x belongs to (0+1)* so it will contain all the strings possible on 0 and 1 which is regular.
In the third language the |x| is limited so it cannot generate all the strings and we also have to match the w with wr which we cant do with it dfa so it is not regular.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2.7k
views
1 answers
0 votes
shekhar chauhan asked Jun 6, 2016
2,688 views
Automata Grammar Regular Language
Regular grammars can only describe regular languages, why reverse is not true .What should be the most appropriate Reason ? Explain with in few Lines .If possible give an exp too.
User Avatar
318
views
1 answers
1 votes
M_Umair_Khan42900 asked Dec 29, 2022
318 views
Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}
Construct pushdown automata that recognize the following language.L= (a²ⁿ b³ⁿ | n ≥ 0}
User Avatar
1.4k
views
1 answers
0 votes
Garrett McClure asked Sep 7, 2017
1,440 views
Computation and Automata - Constructing a DFA from a Language
Find a DFA for the following language on Σ = {0, 1}L = {w : the value of w, interpreted as a binary representation of an integer is zero modulo five}. For example, 0101 and 1111, ... 5) mod 5, (2n + 1) mod 5 = [(2n mod 5) + 1] mod 5.
User Avatar
987
views
1 answers
0 votes
shekhar chauhan asked Jun 8, 2016
987 views
Automata Grammar Language
Write a Grammar which is a not type -3 Grammar, from the Language L over alphabets {a ,b} which contains ab as a Sub-string. Explain the procedure with Example .
User Avatar
Link Copied!