Recent questions tagged nfa-dfa - GATE CSE Doubts

0 votes

0 answers

AppliedGate lecture example
What is the NFA that does not accept strings ending “101” ?

asked Apr 7 in Theory of Computation by shri385 (5 points) | 9 views

0 votes

0 answers

An introduction to formal languages and automata peter linz

asked Jan 16 in Theory of Computation by kirtipurohit (15 points) | 30 views

0 votes

1 answer

Self Doubt - ME Notes (TOC)
Construct the minimal DFA for the following $\epsilon$ NFA NOTE: No need to give a complete explanation. Just provide me the final answer whatever you are getting means the number of states and the name of the states.

asked Sep 21, 2020 in Theory of Computation by KUSHAGRA गुप्ता (1.4k points) | 37 views

0 votes

1 answer

Finite-automata
S1: Epsilon nfa has more than one initial state S2: Nfa has more than one initial state Which of the above is true and which of the above is false?

asked Jul 15, 2020 in Theory of Computation by Hrishi00 (5 points) | 37 views

0 votes

1 answer

uppcl AE 2019
For every NFA with arbitrary number of final states, there is a equivalent NFA with only one final state. true/false

asked Nov 8, 2019 in Theory of Computation by amit166 (87 points) | 29 views

+1 vote

1 answer

How atleast become 2^n?
Given An arbitary non-deterministic finite automation with N states,the maximum numer of states in an equivalent minimized DFA is atleast?

asked Aug 19, 2019 in Theory of Computation by bibin765 (9 points) | 23 views

0 votes

2 answers

Is my NFA correct for the question given below?if not then what will be

asked Jul 28, 2019 in Theory of Computation by shaktisingh (103 points) | 49 views

To see more, click for the full list of questions or popular tags.

9,200 questions

3,182 answers

14,686 comments

96,168 users