DSA
Practice Problems
C
C++
Java
Python
JavaScript
Data Science
Machine Learning
Courses
Linux
DevOps

Regular Language and Finite Automata|| (2 Mark)||MSQ||2024

Last Updated :

Discuss

Comments

Consider the 5-state DFA 𝑀 accepting the language 𝐿(𝑀) ⊂ (0 + 1) ^∗shown below. For any string 𝑤 ∈ (0 + 1) ^∗ let 𝑛₀(𝑤) be the number of 0 ′ 𝑠 in 𝑤 and 𝑛₁(𝑤) be the number of 1′𝑠 in 𝑤.

Which of the following statements is/are FALSE?

[GATE 2024||SET-1 MSQ|| 2-mark]

States 2 and 4 are distinguishable in 𝑀

States 3 and 4 are distinguishable in 𝑀

States 2 and 5 are distinguishable in 𝑀

Any string 𝑤 with 𝑛₀ (𝑤) = 𝑛₁(𝑤) is in 𝐿(𝑀)

This question is part of this quiz :

GATE||Regular Language and Finite Automata|| Pyq (2010 to2025),GATE||TOC || Pyq (2010 to2025)

Tags:

GATE CS

GATE

Theory of Computation

DFA

+1 More

Share your thoughts in the comments

GeeksforGeeks

Article Tags :

DFA,
GATE CS