Theory of Computation (DFA & NFA)

amarkaswan asked Oct 12, 2016

293 views

0 votes

1) if |L1| < |L2| then L1 must be finite Trye/False?

Theory of Computation
finite-automata

+ –

amarkaswan asked Oct 12, 2016

amarkaswan

293 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 votes

i think it is false
B/C
|L2| can be uncountable
and |L1| can be countable

Shubham Pandey 2 answered Oct 16, 2016

Shubham Pandey 2

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

1 answer

Souvik33 asked Nov 7, 2022

351 views

Theory Of Computation (NFA/DFA)
**MSQ** The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s) 0 1 01 10

MSQ The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s)010110

Souvik33

351 views

Souvik33 asked Nov 7, 2022

Theory of Computation
finite-automata
theory-of-computation
easy

+ –

0 votes

1 answer

jenny101 asked Dec 6, 2016

482 views

nfa theory of computation
The answer to this question is given as 6.

The answer to this question is given as 6.

jenny101

482 views

jenny101 asked Dec 6, 2016

Theory of Computation
theory-of-computation
finite-automata

+ –

0 votes

1 answer

aditi19 asked Dec 14, 2018

1,333 views

Conversion of NFA to DFA
convert the following NFA to DFA

convert the following NFA to DFA

aditi19

1.3k views

aditi19 asked Dec 14, 2018

Theory of Computation
theory-of-computation
finite-automata

+ –

1 votes

1 answer

garvit_vijai asked Jun 9, 2018

5,402 views

Conversion of DFA to NFA
Q.) Given an arbitrary DFA with 2N states, what will be the number of states of the corresponding NFA? a) N x N b) 2N c) 2N d) N! Now, as we know that -> no. of states in minimal DFA >= no. of states in NFA. So, anything less ... can be the answer but the answer which I found in the source is option (b) i.e 2N. Please suggest the proper explanation for this problem.

Q.) Given an arbitrary DFA with 2N states, what will be the number of states of the corresponding NFA?a) N x Nb) 2Nc) 2Nd) N!Now, as we know that - no. of states in minim...

garvit_vijai

5.4k views

garvit_vijai asked Jun 9, 2018

Theory of Computation
finite-automata
theory-of-computation

+ –

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