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
Some useful problems
Recent questions tagged finite-automata
0
votes
0
answers
1
#toc
Çșȇ ʛấẗẻ
asked
in
Theory of Computation
Feb 24
by
Çșȇ ʛấẗẻ
65
views
theory-of-computation
finite-automata
regular-expression
regular-language
context-free-language
0
votes
2
answers
2
#Convert the NFA in to equivalent R.E.
Çșȇ ʛấẗẻ
asked
in
Theory of Computation
Feb 24
by
Çșȇ ʛấẗẻ
117
views
theory-of-computation
finite-automata
0
votes
0
answers
3
#TOC
Çșȇ ʛấẗẻ
asked
in
Databases
Feb 24
by
Çșȇ ʛấẗẻ
42
views
theory-of-computation
finite-automata
regular-expression
regular-language
0
votes
0
answers
4
Regular expression to finite automata
Çșȇ ʛấẗẻ
asked
in
Mathematical Logic
Feb 15
by
Çșȇ ʛấẗẻ
187
views
finite-automata
theory-of-computation
regular-expression
3
votes
1
answer
5
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 32
Which of the following sets has the greatest cardinality? The set of real numbers R The set of all functions from R to {0,1} The set of all finite subsets of natural numbers The set of all finite-length binary strings
GO Classes
asked
in
Theory of Computation
Feb 5
by
GO Classes
391
views
goclasses2024-mockgate-14
theory-of-computation
finite-automata
1-mark
5
votes
1
answer
6
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 24
Let $\mathrm{M}$ be a $8$-state Deterministic Finite Automaton over the alphabet $\{a, b, c\}$. If the language accepted by $\text{M}$ i.e. $\text{L(M)}$ is finite, then the maximum possible cardinality of $\text{L(M)}$ is __________.
GO Classes
asked
in
Theory of Computation
Jan 28
by
GO Classes
496
views
goclasses2024-mockgate-13
goclasses
numerical-answers
theory-of-computation
finite-automata
1-mark
3
votes
1
answer
7
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 25
A garage door opens if it ever sees the password $011$ in a transmission. More formally, this FSM takes a bitstring consisting of $\text{0's}$ and $\text{1's}$ as its input, and continually outputs $\text{0's}$ until it sees the substring $011,$ after which ... ? Arrow $1 - (0/0)$ Arrow $3 - (1/0)$ Arrow $4 - (1/0)$ Arrow $5 - (1/1)$
GO Classes
asked
in
Digital Logic
Jan 28
by
GO Classes
323
views
goclasses2024-mockgate-13
goclasses
digital-logic
sequential-circuit
finite-automata
multiple-selects
1-mark
3
votes
1
answer
8
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 15
Consider the following NFA $M$ and say what language is recognised by constructing the machine that recognises the complement of $L(M)$ in $\{a\}^*$. $\emptyset$ $\{a\}^*$ $\{a\}$ $\{\varepsilon\}$
GO Classes
asked
in
Theory of Computation
Jan 21
by
GO Classes
416
views
goclasses2024-mockgate-12
goclasses
theory-of-computation
finite-automata
1-mark
easy
8
votes
1
answer
9
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 43
Let $\text{D}$ be a DFA with $n$ states $\& \;\text{N}$ be an NFA with $n$ states. Which of the following is/are true? If $\text{D}$ accepts some string of length $n$, then the language of $\text{D}$ is infinite ... $\mathrm{N}$ accepts some string of length $n-1$, then the language of $\mathrm{N}$ is infinite.
GO Classes
asked
in
Theory of Computation
Jan 21
by
GO Classes
593
views
goclasses2024-mockgate-12
goclasses
theory-of-computation
finite-automata
multiple-selects
2-marks
4
votes
2
answers
10
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 62
Below you see the transition table of a finite state automaton. The initial state is $0;$ the final state is $4.$ $\emptyset$ denotes the fail state, where no successful transition is possible for the given symbol. Note that when encountering a $b$ in state ... $\mathrm{abbb}^+\mathrm{c}^+\mathrm{c}$ $a b^* b b(c c)^+$
GO Classes
asked
in
Theory of Computation
Jan 13
by
GO Classes
291
views
goclasses2024-mockgate-11
goclasses
theory-of-computation
finite-automata
regular-expression
2-marks
4
votes
1
answer
11
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 63
This question concerns two languages over the alphabet $\Sigma=\{1,-1\}$ (note that this is an alphabet with just two symbols: $1$ and $-1 ).$ The two symbols are interpreted, in the natural way, as the numbers $1$ and $-1,$ in ... $\text{L}_1$ Only $\text{L}_2$ Both None
GO Classes
asked
in
Theory of Computation
Jan 13
by
GO Classes
505
views
goclasses2024-mockgate-11
goclasses
theory-of-computation
finite-automata
regular-language
2-marks
0
votes
1
answer
12
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
245
views
theory-of-computation
finite-automata
number-of-dfa
minimal-state-automata
0
votes
1
answer
13
Not Regular language [find out]
Why is C is regular as it non regular as? Please help me with this confusion
Deepak9000
asked
in
Theory of Computation
Nov 27, 2023
by
Deepak9000
189
views
finite-automata
theory-of-computation
regular-language
0
votes
1
answer
14
Regular grammar
Çșȇ ʛấẗẻ
asked
in
Theory of Computation
Nov 22, 2023
by
Çșȇ ʛấẗẻ
164
views
theory-of-computation
regular-grammar
finite-automata
0
votes
1
answer
15
#Regular Languages
For a particular input, a turing machine can ‘hang’ on encountering an infinite loop. Why can’t we say the same for any other machine? i.e A DFA or NFA that follows say a*(b). Will the automaton not ‘hang’ if a string $a^n$ where $n \to$ ∞ is fed to it? Isn’t ‘never accepting but progressing’ the same as hanging?
Mrityudoot
asked
in
Theory of Computation
Oct 21, 2023
by
Mrityudoot
314
views
theory-of-computation
regular-expression
finite-automata
regular-language
0
votes
1
answer
16
Automata and Formal Languages
jam
asked
in
Theory of Computation
Oct 18, 2023
by
jam
204
views
theory-of-computation
finite-automata
0
votes
1
answer
17
Please help how to draw dfa
Çșȇ ʛấẗẻ
asked
in
Theory of Computation
Oct 2, 2023
by
Çșȇ ʛấẗẻ
234
views
finite-automata
0
votes
1
answer
18
TOC Find the language
Çșȇ ʛấẗẻ
asked
in
Algorithms
Sep 14, 2023
by
Çșȇ ʛấẗẻ
102
views
finite-automata
1
vote
1
answer
19
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
361
views
minimal-state-automata
finite-automata
theory-of-computation
number-of-states
0
votes
2
answers
20
MADE EASY test series
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to
jugnu1337
asked
in
Theory of Computation
Sep 3, 2023
by
jugnu1337
321
views
made-easy-test-series
finite-automata
0
votes
0
answers
21
Theory of computations
Çșȇ ʛấẗẻ
asked
in
Mathematical Logic
Aug 28, 2023
by
Çșȇ ʛấẗẻ
110
views
finite-automata
0
votes
1
answer
22
Theory of computation
Çșȇ ʛấẗẻ
asked
in
Mathematical Logic
Aug 28, 2023
by
Çșȇ ʛấẗẻ
104
views
finite-automata
Page:
1
2
3
4
5
6
...
35
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
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent questions tagged finite-automata
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation