Register

Testbook Chapter Test on Finite Automata (CT: 19)

658 views
0 0 votes

Which of the following statements is/are true?

  1. The language denoted by the regular expression (ϕ*)* is ϵ
  2. The language denoted by the regular expression a ϕ is ϕ
  3. The regular expression for the language L={vuv|v,u∈{a,b}*,|v|≤3 } is L=(a+b)*
  4. The language denoted by the regular expression (ϕ*)* is ϕ

 

The correct answer is option 1, option 2, and option 3.

How can 1 be true? Since, phi (ϕ) denotes an empty set, zero or more combinations of it will still denote an empty set, right?  Whereas, epsilon (ϵ) is not an empty set.

 And option 4 is True, right?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · What is an external ...Next → · Study Material Reque...
← Previous in category · GO Classes CS Test S...Next in category → · Theory Of Computatio...
Position:
Show:

Related questions

0 0 votes
1 1 answer
863
863 views
Aboveallplayer asked Dec 20, 2016
863 views
TestBook Test Series: Theory Of Computation - Finite Automata
what is the number of states in dfa of all language over {a,b} where n(a)mod3>=n(b)mod2 how to think in this kind of question ??
2 2 votes
4 answers 4 answers
2.3k
2.3k views
vijaycs asked Jul 10, 2016
2,295 views
TestBook Test Series: Theory Of Computation - Finite Automata
The minimum number of states in a DFA that recognizes the language L = (000 + 0000)* over the alphabet {0}.
1 1 vote
1 answers 1 answer
1.1k
1.1k views
Akash Kanase asked Jan 15, 2016
1,073 views
TestBook Test Series: Theory Of Computation - Finite Automata
Only way NFA of 6 states can be reduced to DFA of one state if all remaining 5 states of NFA are useless (Unreachable etc) & THere are no Dead State. In any normal NFA wi...
0 0 votes
3 3 answers
2.5k
2.5k views
Shubham Pande asked Jun 29, 2017
2,545 views
An Intro. to formal lang. and automata(Peter Linz) chapter 2.....2.1 ques 6
With Σ = {a,b}, give a dfa for L= w1aw2 :|w1|≥ 3,|w2|≤ 5