Register
Dark Mode

The string for which the grammar has maximum of two derivation trees is

in Theory of Computation
735 views
1 vote
1 vote
The string for which the grammar has maximum of two derivation trees is

(a) lion tiger lion
(c) tiger lion
(b) lion tiger
(d) None of the above
in Theory of Computation
by
735 views

4 Comments

by
which grammar?
0
0
by

This was a linked question. The above is DFA given

0
0
by

This is the question

0
0
by
I think the answer is option a)
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
4
Anuanu asked in Programming in C Jun 24, 2016
401 views
what is the number of steps required to derive the string ((() ()) ()) for the folling grammar
Anuanu asked in Programming in C Jun 24, 2016
by Anuanu
401 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!