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
madeeasy
nihal_chourasiya
asked
in
Theory of Computation
Jan 15
66
views
0
votes
0
votes
Proof for 2
nd
equality?
made-easy-test-series
nihal_chourasiya
asked
in
Theory of Computation
Jan 15
by
nihal_chourasiya
66
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
nihal_chourasiya
asked
in
Theory of Computation
Jan 15
97
views
madeeasy
Proof for 2nd equality?
nihal_chourasiya
asked
in
Theory of Computation
Jan 15
by
nihal_chourasiya
97
views
made-easy-test-series
0
votes
0
votes
5
answers
2
Rohit Chakraborty
asked
in
Theory of Computation
Apr 9, 2023
633
views
MadeEasy
Match List-l with List-|l and select the correct answer using the codes given below the lists: List-I List-II A. Regular grammar 1. Pushdown automaton B. Context free grammar 2. Linear bounded automaton C Unrestricted grammar 3. Deterministic finite . D. Context sensitive grammar 4. Turing machine Codes: A B C D (a) 3 1 2 4 (b) 3 1 4 2 Which of the options are correct and why?
Rohit Chakraborty
asked
in
Theory of Computation
Apr 9, 2023
by
Rohit Chakraborty
633
views
made-easy-test-series
finite-automata
0
votes
0
votes
2
answers
3
Rohit Chakraborty
asked
in
Theory of Computation
Apr 9, 2023
443
views
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
made-easy-test-series
theory-of-computation
number-of-dfa
5
votes
5
votes
3
answers
4
Hirak
asked
in
Theory of Computation
May 25, 2019
1,807
views
MadeEasy Test Series: Theory Of Computation - Regular Languages
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
Hirak
asked
in
Theory of Computation
May 25, 2019
by
Hirak
1.8k
views
made-easy-test-series
theory-of-computation
regular-language
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
