If ∑= {0,1}, then Ф* will result to: – McqOptions

MCQOPTIONS

Saved Bookmarks

→ Automata Theory Questions and Answers
→ Ambiguous Grammar in Automata Theory Questions and Answers
→ If ∑= {0,1}, then Ф* will result to:..

1.	If ∑= {0,1}, then Ф* will result to:
A.	ε
B.	Ф
C.	∑
D.	None of the mentioned
Answer» B.

Discussion

No Comment Found

Related MCQs

Which of the following regular expressions represents the set of strings which do not contain a substring ‘rt’ if ∑= {r, t}
Which of the following represents a language which has no pair of consecutive 1’s if ∑= {0,1}?
If ∑= {0,1}, then Ф* will result to:
Let for ∑= {0,1} R= (∑∑∑) *, the language of R would be

Related Topics

Ambiguous Grammar in Automata Theory Questions and Answers

Applications of DFA in Automata Theory Questions and Answers

Applications of NFA in Automata Theory Questions and Answers

Applications of Pumping Lemma/Pigeonhole principle in Automata Theory Questions and Answers

Applications-Parsers in Automata Theory Questions and Answers

Building Regular Expressions in Automata Theory Questions and Answers

CFG-Eliminating Useless Symbols in Automata Theory Questions and Answers

CFL- Closure Properties/Decision Properties in Automata Theory Questions and Answers

CFL- Other Normal Forms in Automata Theory Questions and Answers

Chomsky Normal Form in Automata Theory Questions and Answers

Recent Visits

Reply to Comment

Name *

Email *

Comment *

© Copyright 2025 McqOptions. All rights reserved.

Terms & Conditions
Privacy Policy
Disclaimer

Support: admin@mcqoptions.com