Postal Book Course

Q : Let M= (Q, ∑, δ, S, F) and M’= (Q, ∑, δ, S, Q – F) where M accepts L and M’ accepts L1 and M is NFA, what could be the relation between L and L’ ?(a) L ...

Manish Chetwani

2.2k views

Manish Chetwani asked Sep 15, 2017

Theory of Computation
theory-of-computation
finite-automata

+ –

0 votes

1 answer

Luci3671 asked Nov 11, 2022

271 views

Made easy postal course example problem
What will be the DFA for wxw^r where w belongs to (a,b)^+ and x belongs to (a,b)^+

What will be the DFA for wxw^r where w belongs to (a,b)^+ and x belongs to (a,b)^+

Luci3671

271 views

Luci3671 asked Nov 11, 2022

Theory of Computation
theory-of-computation
finite-automata

+ –

3 votes

2 answers

Rajesh Reddy asked Jan 3, 2022

618 views

#Gate CS Applied Course Mock Test
Is this Language a CFL? If yes, Can you please explain the implementation.

Is this Language a CFL?If yes, Can you please explain the implementation.

Rajesh Reddy

618 views

Rajesh Reddy asked Jan 3, 2022

Theory of Computation
theory-of-computation
context-free-language
context-free-grammar

+ –

2 votes

1 answer

Applied Course asked Jan 16, 2019

697 views

Applied Course | Mock GATE | Test 1 | Question: 52
Which of the following languages are not CFLs $L=\{ 0^n 1^n0^n 1^n \mid n \geq 0\}$ $L=\{0 \# 0^{2n} \# 0^{3n} \mid n \geq 0\}$ $L=\{a^n b^m c^m d^n \mid m,n \geq 0\}$ $L=\{ x \# y \mid x,y \in \{0, 1\}^* \text{ and } x \neq y\}$ II and III only III and IV only I and II only I, II and IV only

Which of the following languages are not CFLs$L=\{ 0^n 1^n0^n 1^n \mid n \geq 0\}$$L=\{0 \# 0^{2n} \# 0^{3n} \mid n \geq 0\}$$L=\{a^n b^m c^m d^n \mid m,n \geq 0\}$$L=\{ ...

Applied Course

697 views

Applied Course asked Jan 16, 2019

Theory of Computation
applied-course-2019-mock1
theory-of-computation
context-free-language

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

0

0