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
#TOC
Çșȇ ʛấẗẻ
asked
in
Databases
Feb 24
1
flag
54
views
0
votes
0
votes
theory-of-computation
finite-automata
regular-expression
regular-language
🚩 Spam
|
👮
saurabh0709
|
💬 “This question should be asked in TOC not in DBMS”
Çșȇ ʛấẗẻ
asked
in
Databases
Feb 24
1
flag
by
Çșȇ ʛấẗẻ
54
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Çșȇ ʛấẗẻ
asked
in
Theory of Computation
Feb 24
82
views
#toc
Çșȇ ʛấẗẻ
asked
in
Theory of Computation
Feb 24
by
Çșȇ ʛấẗẻ
82
views
theory-of-computation
finite-automata
regular-expression
regular-language
context-free-language
0
votes
0
votes
1
answer
2
Mrityudoot
asked
in
Theory of Computation
Oct 21, 2023
332
views
#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
332
views
theory-of-computation
regular-expression
finite-automata
regular-language
0
votes
0
votes
1
answer
3
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
753
views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
753
views
theory-of-computation
regular-language
regular-expression
finite-automata
2
votes
2
votes
3
answers
4
coder97
asked
in
Theory of Computation
Oct 5, 2021
685
views
Regular expressons
The minimum number of states in an equivalent finite automata for the given regular expression are _____ (a(a(a(a(a(ab)*b)*b)*b)*b)*b)*
coder97
asked
in
Theory of Computation
Oct 5, 2021
by
coder97
685
views
theory-of-computation
regular-expression
regular-language
finite-automata
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 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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy