The Gateway to Computer Science Excellence
0 votes
18 views

The following grammar generates the language of regular expression $0^{*}1(0+1)^{*}:$

$S\rightarrow A1B$
$A\rightarrow 0A|\in$
$B\rightarrow B|1B|\in$

Give leftmost and rightmost derivations of the following strings$:$

  1. $00101$ 
  2. $1001$ 
  3. $00011$
in Theory of Computation by Veteran (55k points) | 18 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,645 questions
56,601 answers
195,849 comments
102,208 users