The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

The set A= {0n1n2n∣n=1,2,3,.......} is an example of a grammar that is

  1. Context sensitive 
  2. Context-free 
  3. Regular
  4. None of the above
asked in Theory of Computation by Junior (797 points) | 206 views

1 Answer

+1 vote

Answer : 1

The given language is Standard Context Sensitive language. 

answered by Boss (19.5k points)

Related questions

0 votes
1 answer
asked Jul 11 in Theory of Computation by Sanjay Sharma Boss (49.6k points) | 111 views

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

42,619 questions
48,614 answers
63,860 users