Register

question bank

918 views
0 votes
0 votes

Consider the following statements:
S1: Infinite union of regular languages can be context-free.
S2: Language obtained after applying Kleen closure on a regular language will always be regular and infinite.
Which of the above statement is true?

User Avatar

1 Answer

Best answer
2 votes
2 votes

S1: Infinite union of regular languages can be context-free.  True {ab,aabb,aaabbb......} = {anbn | n>0}
S2: Language obtained after applying Kleen closure on a regular language will always be regular and infinite. No since {phi}* = null only  

S1: is true only.

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
Hirak asked May 22, 2019
1,063 views
Ace Academy Question Bank: Automata
Find the no. of DFA’s that can be constructed over the alphabet Σ with 5 symbols, and with 10 states. (a) $2^5$^0$ × $50^5$ (b) $2^1$^0$ × $10^5$^0$ (c) $2^5$ × $10^5$^0$ (d) $2^5$^0$ × $50^5$
Find the no. of DFA’s that can be constructed over the alphabet Σ with 5 symbols, and with 10 states.(a) $2^5$$^0$ × $50^5$ (b) $2^1$$^0$ × $10^5$$^0$(c) $2^5$ × ...
User Avatar
0 votes
0 votes
1 answer
2
Hirak asked Apr 7, 2019
542 views
Vani institute question bank
5. For n ≥ 0, Ln = {a^i b^k | i ≥ n, 0 < k < i} (a) Ln is regular, independent of value of n (b) Ln is not regular, independent of value of n (c) Ln is regular only for small value of n (d) None of above
5. For n ≥ 0, Ln = {a^i b^k | i ≥ n, 0 < k < i} (a) Ln is regular, independent of value of n(b) Ln is not regular, independent of value of n(c) Ln is regular only ...
User Avatar
0 votes
0 votes
0 answers
3
shubham007 asked Aug 19, 2018
500 views
ace quetion bank
the minimal finite automata accepting the set of all strings over { 0, 1} starting with 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 has ______ states.
the minimal finite automata accepting the set of all strings over { 0, 1} starting with 1 that interpreted as the binary representation of an integer are congruent to 0 m...
User Avatar
0 votes
0 votes
1 answer
4
Anusam asked Jul 16, 2018
379 views
Gkp question bank
If set contains∑={ a,b,c,d,e,f}then no of strings in ∑ of length 4 such that no symbol is used more than once in the string is ?
If set contains∑={ a,b,c,d,e,f}then no of strings in ∑ of length 4 such that no symbol is used more than once in the string is ?
User Avatar
Link Copied!