in Theory of Computation
20 views
0 votes
0 votes

Which of the following languages is (are) non-regular?

  • $L_1 = \{0^m1^n \mid 0 \leq m \leq n \leq 10000\}$
  • $L_2 = \{w \mid w $ reads the same forward and backward$\}$
  • $L_3 = \{w \in \{0, 1\} ^* \mid  w$ contains an even number of 0's and an even number of 1's$\}$
  1. $L_2$ and $L_3$ only
  2. $L_1$ and $L_2$ only
  3. $L_3$ only
  4. $L_2$ only
in Theory of Computation
by
589 points
20 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.