Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged minimal-state-automata
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
by
Hritik1204
252
views
theory-of-computation
finite-automata
number-of-dfa
minimal-state-automata
1
vote
1
answer
2
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)
stillhere
asked
in
Theory of Computation
Sep 10, 2023
by
stillhere
366
views
minimal-state-automata
finite-automata
theory-of-computation
number-of-states
0
votes
2
answers
3
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
roopkathaaa
asked
in
Operating System
Sep 2, 2023
by
roopkathaaa
1.4k
views
threads
operating-system
deadlock-prevention-avoidance-detection
minimal-state-automata
made-easy-test-series
0
votes
1
answer
4
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
roopkathaaa
asked
in
Operating System
Sep 2, 2023
by
roopkathaaa
794
views
operating-system
threads
deadlock-prevention-avoidance-detection
made-easy-test-series
minimal-state-automata
0
votes
1
answer
5
Design DFA contain all strings of a's and B's which each string starts with 'ab' and end with 'ab'.
BINDU Prasad
asked
in
Theory of Computation
Jul 4, 2023
by
BINDU Prasad
271
views
minimal-state-automata
9
votes
4
answers
6
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 ____________.
admin
asked
in
Theory of Computation
Feb 15, 2023
by
admin
9.0k
views
gatecse-2023
theory-of-computation
minimal-state-automata
numerical-answers
2-marks
1
vote
2
answers
7
Minimum number of states
Dknights
asked
in
Theory of Computation
Jan 12, 2023
by
Dknights
337
views
minimal-state-automata
1
vote
1
answer
8
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
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
288
views
theory-of-computation
regular-language
pushdown-automata
context-free-language
minimal-state-automata
1
vote
1
answer
9
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.
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
2.1k
views
theory-of-computation
regular-expression
finite-automata
pushdown-automata
minimal-state-automata
computer
3
votes
0
answers
10
gateforum
h4kr
asked
in
Theory of Computation
Nov 18, 2022
by
h4kr
281
views
gateforum-test-series
theory-of-computation
minimal-state-automata
2
votes
1
answer
11
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?
Pranavpurkar
asked
in
Theory of Computation
Nov 11, 2022
by
Pranavpurkar
385
views
theory-of-computation
test-series
minimal-state-automata
regular-language
0
votes
2
answers
12
How to do questions of ToC like finding min. No. Of states , min. No. Of substring etc ?
Ferox
asked
in
Theory of Computation
Oct 9, 2022
by
Ferox
409
views
theory-of-computation
minimal-state-automata
0
votes
0
answers
13
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
asked
in
Theory of Computation
Oct 9, 2022
by
Ferox
262
views
theory-of-computation
minimal-state-automata
1
vote
1
answer
14
Theory of Computation
Steps to find the answer?
Overflow04
asked
in
Theory of Computation
Jul 16, 2022
by
Overflow04
548
views
theory-of-computation
ace-test-series
regular-expression
minimal-state-automata
4
votes
2
answers
15
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 ________
GO Classes
asked
in
Theory of Computation
Jun 9, 2022
by
GO Classes
498
views
goclasses2024-toc-1-weekly-quiz
numerical-answers
goclasses
theory-of-computation
finite-automata
minimal-state-automata
2-marks
0
votes
0
answers
16
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 \}$
ankit-saha
asked
in
Theory of Computation
Mar 24, 2022
by
ankit-saha
335
views
theory-of-computation
finite-automata
minimal-state-automata
0
votes
1
answer
17
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
abhinowKatore
asked
in
Theory of Computation
Mar 7, 2022
by
abhinowKatore
388
views
theory-of-computation
regular-languages
finite-automata
minimal-state-automata
decidability
0
votes
1
answer
18
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?
shivajikobardan
asked
in
Theory of Computation
Nov 1, 2021
by
shivajikobardan
2.4k
views
theory-of-computation
finite-automata
minimal-state-automata
3
votes
1
answer
19
Number of final states
A FA accepting language L(A) has n states and m transition. ∑ = {a, b} L(A) is given as L(A)={ x | if x ∊ L(A) then u ∊ L(A) for $∃u, v ∊ ∑^{*}$ where x=uv } Find number of final state in above DFA?
Nishisahu
asked
in
Theory of Computation
Oct 8, 2021
by
Nishisahu
356
views
theory-of-computation
minimal-state-automata
finite-automata
Page:
1
2
3
4
5
6
7
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged minimal-state-automata
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...