Dark Mode

Recent questions tagged number-of-dfa

0 votes

1 answer

1

Find the number of final states in DFA that recognizes L, where L= {w1a w2:|w1|≥3,|w2|≤5}, ∑={a, b} and w1, w2 ∈ ∑ * ______

Hritik1204 asked in Theory of Computation Jan 5

264 views

0 votes

1 answer

2

parsers and dfa construction
Hi, there my question is while constructing DFA for LL(1) or LR(0), or SLR (1). parsing I'm seeing different variants of DFA for the same problem set, and I'm not able to determine which is correct and which is not please help I'm providing a question ... S->dA/aB A->bA/c B->bB/c so first is this second is this which one is correct and why please ex

utkarsh2077 asked in Compiler Design Dec 4, 2023

179 views

0 votes

0 answers

3

Michael Sipster Theory of Computation
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.

baofbuiafbi asked in Theory of Computation Nov 14, 2023

156 views

1 vote

2 answers

4

DFA to Regular Expression
Help to Convert DFA in to Regular Expression

alexmurugan asked in Theory of Computation Nov 2, 2023

435 views

0 votes

1 answer

5

Made easy test series
Please explain the why A and D are correct?

Rohit Chakraborty asked in Theory of Computation Oct 5, 2023

by Rohit Chakraborty

446 views

1 vote

1 answer

6

Applied Roots TOC practice set 2 2019

iam.sahilpatra asked in Theory of Computation Sep 9, 2023

by iam.sahilpatra

148 views

1 vote

2 answers

7

Convert given DFA to regular expression, I think it's just that 2 is dead state and thus can be eliminated.

Shaina Singh asked in Theory of Computation Jul 30, 2023

by Shaina Singh

781 views

0 votes

1 answer

8

Can someone help me for better understanding.

Tarungujral89 asked in Theory of Computation May 4, 2023

by Tarungujral89

295 views

0 votes

2 answers

9

MadeEasy
Consider the following deterministic finite automation Let S denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. Then which of the following strings is/are in S that are accepted by M. 01110111 01111010 10101010 01110110

Rohit Chakraborty asked in Theory of Computation Apr 9, 2023

by Rohit Chakraborty

443 views

0 votes

0 answers

10

Gate 2023
Consider the language L over the alphabet {0, 1}, given below: L = {w ∈ {0, 1}* | w does not contain three or more consecutive 1’s}. The minimum number of states in a Deterministic Finite-State Automaton (DFA) for L is ______ .

ic3rror asked in Theory of Computation Feb 16, 2023

1.6k views

0 votes

0 answers

11

Computational Theory
Give the state diagram of DFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is {0, 1}. {w | accept all string except 11 or 110} {w | w begins with a 11 and ends with a 0} {w | All string accepted except ... w | w contains at least three 0s } { w | w contains the substring 0101, i.e., w = x0101y for some x and y }

ahmed5 asked in Theory of Computation Feb 7, 2023

by ahmed5

408 views

0 votes

1 answer

12

Class Test AFLL Revision
How many states does the DFA and NFA constructed for the “set of all binary strings where the second last symbol will never be a 1” have?

dawndarcy asked in Others Jan 12, 2023

523 views

1 vote

1 answer

13

Theory of Computation
Number of 3 state DFA with designated initial state can be constructed over the alphabet $\sum$ = {0,1,2} with exactly 2 final states is $3^{8}$ B)$3^{9}$ C) $3^{10}$ D) $3^{11}$ Answer is C

Overflow04 asked in Theory of Computation Oct 30, 2022

544 views

0 votes

1 answer

14

GATE CSE 2020
Is this language a regular language ? If yes why and if No why ? The last part is “x!=y” cropped in the picture According to my understanding this is not regular because its says number of x = number of y But Finite automata cant compare the number of x and y here with limited memory. Can you please explain ?

dutta18 asked in Theory of Computation Sep 22, 2022

1.3k views

0 votes

1 answer

15

Conversion of Regular expression to Finite Automata
What is the Finite Automata( NFA, epsilon-NFA or DFA) for the regular expression (a*ba)* ?

dutta18 asked in Theory of Computation Sep 21, 2022

430 views

0 votes

0 answers

16

B) Construct DFA for the following regular expressions and assure the minimum number of states in the constructed DFA. (i) ab*a*(a/b) (ii) 1(1+0)* + 10(0 + 1) *

ankitak70853211234 asked in Compiler Design Jul 2, 2022

by ankitak70853211234

473 views

1 vote

1 answer

17

Testbook test Series
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 consecutive b’s, overlapping permitted}

Rajat Agrawal007 asked in Theory of Computation Nov 18, 2021

by Rajat Agrawal007

2.2k views

1 vote

1 answer

18

NIELIT 2017 DEC Scientific Assistant A - Section B: 50
How many DFA's exits with two states over input alphabet $\left \{ 0,1 \right \}$ $16$ $26$ $32$ $64$

admin asked in Theory of Computation Mar 31, 2020

by admin

992 views

3 votes

3 answers

19

Ace Test Series: Theory Of Computation - Finite Automata
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language? $4$ $16$ $20$ $24$

Hirak asked in Theory of Computation May 22, 2019

by Hirak

1.4k views

3 votes

2 answers

20

ACE ACADEMY: TOC
How many 2 state DFA’s with designated initial state can be constructed over the alphabet Σ = {a, b} that accept empty language ϕ ? (a) 4 (b) 16 (c) 20 (d) 24

Hirak asked in Theory of Computation May 22, 2019

by Hirak

2.3k views

2 votes

1 answer

21

Ace Academy Question Bank: Automata
Find the no. of DFA’s that can be constructed over the alphabet Σ with 5 symbols, and with 10 states. (a) $2^5$^0$ × $50^5$ (b) $2^1$^0$ × $10^5$^0$ (c) $2^5$ × $10^5$^0$ (d) $2^5$^0$ × $50^5$

Hirak asked in Theory of Computation May 22, 2019

by Hirak

1.0k views

0 votes

1 answer

22

Self Doubt
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00 or 11.

kumar.dilip asked in Theory of Computation Jan 19, 2019

752 views

3 votes

2 answers

23

Number of DFA's (Made easy test series)
The number of DFA's with four states which can be constructed of the alphabet $\Sigma = \{ a,b \}$ with a designated initial state are $2^n$, then the value of n is _____. IN DFA IT IS COMPULSORY TO HAVE 1 FINAL STATE. 4c0 should not be taken,correct me?

twin_123 asked in Theory of Computation Nov 18, 2018

2.1k views

1 vote

1 answer

24

Grammar to DFA Construction
For the given Grammar S->aA|bB A->bC|aS B->aC|bS C->aB|bA Construct DFA I am getting confused in understanding how to take the final state.

sripo asked in Theory of Computation Oct 13, 2018

by sripo

1.3k views

0 votes

1 answer

25

Madeeasy workbook
Why this language is regular ? And answer to this question ?

Arjun045 asked in Theory of Computation Sep 30, 2018

343 views

0 votes

1 answer

26

Theory of computation dfa construction
$\Large L = \left \{ a^{m^n} | n \geq 1, m > n \right \}$ What is the Minimum no.of states in a DFA which accept this language

Mudita asked in Theory of Computation Sep 19, 2018

by Mudita

453 views

0 votes

1 answer

27

#Number of DFAs
Find the no. of DFA’s that can be constructed over the alphabet Σ with 5 symbols, and with 10 states?

himgta asked in Theory of Computation Jul 24, 2018

by himgta

1.2k views

0 votes

1 answer

28

Parshu gate asked in Theory of Computation Nov 5, 2017

492 views

2 votes

1 answer

29

SELF DOUBT
If we are having n states and m alphabets..how many DFAs and NFAs are possible?

Vivek Jain asked in Theory of Computation Aug 10, 2017

430 views

1 vote

1 answer

30

Classroom notes
PLease help me , i have seen the same questions in many places but didnt understand the solution .

Parshu gate asked in Theory of Computation Aug 4, 2017

669 views

Page:

Recent questions tagged number-of-dfa