@

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

WBUT 2011

Sourav_35 asked in Theory of Computation May 27, 2018 retagged May 28, 2018 by Subarna Das

410 views

0 votes

0 votes

Construct a NFA for $r=(11+0)^*(00+1)^*$

finite-automata
regular-expression
theory-of-computation

Sourav_35 asked in Theory of Computation May 27, 2018 retagged May 28, 2018 by Subarna Das

410 views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

2 votes

2 votes

We can first make a rough FA model for the RE.

Afterwards, We can make Epsilon-NFA and then easily convert that into NFA without epsilon.

lokeshsolanki17 answered May 28, 2018

by lokeshsolanki17

0 Comments

Please log in or register to add a comment.

← 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

Çșȇ ʛấẗẻ asked in Theory of Computation Feb 24

by Çșȇ ʛấẗẻ

82 views

theory-of-computation
finite-automata
regular-expression
regular-language
context-free-language

4 votes

4 votes

2 answers

2

GO Classes asked in Theory of Computation Jan 13

315 views

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

315 views

goclasses2024-mockgate-11
goclasses
theory-of-computation
finite-automata
regular-expression
2-marks

0 votes

0 votes

1 answer

3

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

332 views

theory-of-computation
regular-expression
finite-automata
regular-language

0 votes

0 votes

1 answer

4

M_Umair_Khan42900 asked in Theory of Computation Dec 29, 2022

752 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

752 views

theory-of-computation
regular-language
regular-expression
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:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!