Recent questions tagged minimal-state-automata / GATE Overflow for GATE CSE

1 votes

0 answers

1

How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved?

How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved? Answer Follow·1 Request ...

paressep28

96 views

paressep28 asked Apr 25

0 votes

1 answer

2

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

359 views

Hritik1204 asked Jan 5

1 votes

1 answer

3

Minimal Finite Automata - Theory of Computation
Consider the set of all binary strings where the difference between the number of 0’s and number of 1’s is even. The minimum number of states in a DFA that accepts the given set is _____________? (kindly explain the approach to this problem)

Consider the set of all binary strings where the difference between the number of 0’s and number of 1’s is even. The minimum number of states in a DFA that accepts th...

stillhere

432 views

stillhere asked Sep 10, 2023

0 votes

2 answers

4

deadlocks and threads operating system
A system has 5 process and 3 resources (A, B, C). The maximum count of resources are (10, 5, 7). Consider the following table of resource allocation. MAX (A B C) Allocated (A B C) P0 7 5 3 0 1 0 P1 3 2 2 2 0 0 P2 9 0 2 3 0 2 P3 2 ... these is a safe sequence in Question 13? P1, P3, P4 , P0, P2 only P2, P4, P3, P1, P0 only Both a and b None are safe sequences

A system has 5 process and 3 resources (A, B, C). The maximum count of resources are (10, 5, 7). Consider the following table of resource allocation. MAX(A B C)Alloc...

roopkathaaa

1.7k views

roopkathaaa asked Sep 2, 2023

0 votes

1 answer

5

deadlocks and threads operating system
State true or false. Deadlock detection is possible using the allocation and request matrices alone. A way to recover from deadlock is to take away the resource from one of the processes or to kill the process itself. Banker's algorithm is ... deadlocks by analyzing the unsafe states. True, True, False False, True, True True, False, True False, True, False

State true or false.Deadlock detection is possible using the allocation and request matrices alone.A way to recover from deadlock is to take away the resource from one of...

roopkathaaa

855 views

roopkathaaa asked Sep 2, 2023

0 votes

1 answer

6

Design DFA contain all strings of a's and B's which each string starts with 'ab' and end with 'ab'.

BINDU Prasad

362 views

BINDU Prasad asked Jul 4, 2023

9 votes

4 answers

7

GATE CSE 2023 | Question: 53
Consider the language $L$ over the alphabet $\{0,1\}$, given below: \[ L=\left\{w \in\{0,1\}^{*} \mid w \text { does not contain three or more consecutive } 1 \text { 's }\right\} . \] The minimum number of states in a Deterministic Finite-State Automaton $\text{(DFA)}$ for $L$ is ____________.

Consider the language $L$ over the alphabet $\{0,1\}$, given below:\[L=\left\{w \in\{0,1\}^{*} \mid w \text { does not contain three or more consecutive } 1 \text { 's }\...

admin

9.7k views

admin asked Feb 15, 2023

1 votes

2 answers

8

Minimum number of states

Dknights

372 views

Dknights asked Jan 12, 2023

1 votes

1 answer

9

Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}
Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}

Construct pushdown automata that recognize the following language.L= (a²ⁿ b³ⁿ | n ≥ 0}

M_Umair_Khan42900

300 views

M_Umair_Khan42900 asked Dec 29, 2022

1 votes

1 answer

10

Write regular expression to denote a language L a) String which begin or end with either 00 or 11. b) The set of all strings, when viewed as binary representation of integers, that are divisible by 2. c) The set of all strings containing 00. d) String not containing the substring 110.

Write regular expression to denote a language La) String which begin or end with either 00 or 11.b) The set of all strings, when viewed as binary representation of intege...

M_Umair_Khan42900

2.3k views

M_Umair_Khan42900 asked Dec 29, 2022

3 votes

0 answers

11

gateforum

h4kr

297 views

h4kr asked Nov 18, 2022

2 votes

1 answer

12

Test-Series
Consider the following language over $\sum$ = {0, 1} L = {w | w $\epsilon \sum$ * and |w| is divisible by 2 and not by 4} How many sates will min-DFA accepting L will have?

Consider the following language over $\sum$ = {0, 1}L = {w | w $\epsilon \sum$ * and |w| is divisible by 2 and not by 4}How many sates will min-DFA accepting L will have?...

Pranavpurkar

432 views

Pranavpurkar asked Nov 11, 2022

0 votes

2 answers

13

How to do questions of ToC like finding min. No. Of states , min. No. Of substring etc ?

Ferox

456 views

Ferox asked Oct 9, 2022

0 votes

0 answers

14

How to practice ToC precisely ? Like I am unable to know transitions for intermediate states in dfa design , it takes time and sometimes I am unable to answer !! Ex – Σ ={a,b} design dfa for : 1.exactly 2a and 2b 2. Minimum 2a and minimum 2b In these thinking about intermediate transitions for possible acceptable strings takes time and sometimes i get wrong answer !!! So what to do to get exact accurate answer with min. Of states in such type of ques. ?

Ferox

269 views

Ferox asked Oct 9, 2022

1 votes

1 answer

15

Theory of Computation
Steps to find the answer?

Steps to find the answer?

Overflow04

638 views

Overflow04 asked Jul 16, 2022

4 votes

2 answers

16

GO Classes Test Series 2023 | Theory of Computation | Test 1 | Question: 14
Let $L$ be the language accepted by the following non-deterministic finite automaton with $\epsilon$-transitions: The number of states in the minimal DFA that accepts the language that is recognized by the above NFA over alphabet $\{a\},$ is ________

Let $L$ be the language accepted by the following non-deterministic finite automaton with $\epsilon$-transitions:The number of states in the minimal DFA that accepts the ...

GO Classes

538 views

GO Classes asked Jun 9, 2022

0 votes

0 answers

17

Minimal DFA
What will be the minimal DFA for $\left \{a^{n} :n mod 3 =0 \right \}\cup \left \{a^{n} :n mod 5 =1 \right \}$

What will be the minimal DFA for $\left \{a^{n} :n mod 3 =0 \right \}\cup \left \{a^{n} :n mod 5 =1 \right \}$

ankit-saha

352 views

ankit-saha asked Mar 24, 2022

0 votes

1 answer

18

MADE EASY 2022 Work book -Theory of Computation series
Let L be a regular language on alphabet Σ. The union of the myhill-nerode equivalence classes is always _____, and the pairwise intersection of the myhill-nerode equivalence classes is always Fill up the blanks

Let L be a regular language on alphabet Σ. The union of the myhill-nerode equivalence classes is always _____, and the pairwise intersection of the myhill-nerode equival...

abhinowKatore

410 views

abhinowKatore asked Mar 7, 2022

0 votes

1 answer

19

DFA that accepts aaa or bbb as substring-: How to make?
https://i.stack.imgur.com/v70kK.jpg I have tried but it is wrong as it accepts abba. What is the correct dfa for this?

https://i.stack.imgur.com/v70kK.jpgI have tried but it is wrong as it accepts abba. What is the correct dfa for this?

shivajikobardan

2.6k views

shivajikobardan asked Nov 1, 2021

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