The Gateway to Computer Science Excellence
0 votes

We can use closure properties to help prove certain languages are not regular. Start with the fact that the language $L_{0n1n}=\{0^{n}1^{n}|n\geq 0\}$ is not a regular set. Prove the following languages not to be regular by transforming them using operations known to preserve regularity,to $L_{0n1n}:$

  1.  $\{0^{i}1^{j}|i\neq j\}$
  2.  $\{0^{n}1^{m}2^{n-m}|n\geq m\geq 0\}$
in Theory of Computation by Veteran (60.5k points) | 12 views

Please log in or register to answer this question.

Related questions

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
50,832 questions
57,686 answers
107,195 users