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
Regular Languages
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵ a) an infinite number of solutions b) a finite number of solutions c) is always unique d) none
practicalmetal
asked
in
Theory of Computation
3 days
ago
by
practicalmetal
20
views
regular-language
theory-of-computation
finite-automata
0
votes
1
answer
2
An Introduction to Formal Languages and Automata,6th edition,Exercise 2.3 Q2.
Convert the nfa in Exercise 13, Section 2.2, into an equivalent dfa.
Silver_Reaper
asked
in
Theory of Computation
Jan 28
by
Silver_Reaper
129
views
theory-of-computation
peter-linz
finite-automata
0
votes
0
answers
3
An Introduction to Formal Languages and Automata Peter Linz 6th Edition.Exercise 2.1 4 d,e
For Σ = {a, b}, construct dfa’s that accept the sets consisting of: (d) all strings with at least one b and exactly two a’s. (e) all the strings with exactly two a’s and more than three b’s.
Silver_Reaper
asked
in
Theory of Computation
Jan 24
by
Silver_Reaper
81
views
theory-of-computation
peter-linz
finite-automata
2
votes
1
answer
4
DFA | Madeeasy TOC
Please explain what is difference between $\overline{L(N)}$ and $L(\overline{N}$) ?
abhinowKatore
asked
in
Theory of Computation
Jan 14
by
abhinowKatore
175
views
theory-of-computation
finite-automata
test-series
0
votes
1
answer
5
Class Test AFLL Revision
How many states does the DFA and NFA constructed for the “set of all binary strings where the second last symbol will never be a 1” have?
dawndarcy
asked
in
Others
Jan 12
by
dawndarcy
197
views
finite-automata
number-of-dfa
0
votes
0
answers
6
Testbook Chapter Test on Finite Automata (CT: 19)
Which of the following statements is/are true? The language denoted by the regular expression (ϕ*)* is ϵ The language denoted by the regular expression a ϕ is ϕ The regular expression for the language L={vuv|v,u∈{a,b}*,|v|≤3 } is L=(a ... it will still denote an empty set, right? Whereas, epsilon (ϵ) is not an empty set. And option 4 is True, right?
Rajsukh Mohanty
asked
in
Theory of Computation
Jan 6
by
Rajsukh Mohanty
71
views
finite-automata
theory-of-computation
0
votes
1
answer
7
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
134
views
theory-of-computation
regular-language
regular-expression
finite-automata
0
votes
0
answers
8
For each of the following language, if the language is regular, write down the corresponding regular expression. Else, prove that the language is not regular. a) (0²ⁿ | n ≥ 1) Answer: b) String over the decimal alphabets (0,1,2....9) with characters in sorted orders. c) The set of all even binary numbers
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
53
views
theory-of-computation
regular-language
finite-automata
0
votes
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
146
views
theory-of-computation
regular-expression
finite-automata
pushdown-automata
minimal-state-automata
computer
0
votes
1
answer
10
Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regular L*, where L={ $0^{{m}^{2}} | m\leq 3$ } True False
Souvik33
asked
in
Theory of Computation
Dec 27, 2022
by
Souvik33
160
views
theory-of-computation
finite-automata
regular-language
made-easy-test-series
1
vote
1
answer
11
DRDO CSE 2022 Paper 2 | Question: 10
Construct a Deterministic Finite Automaton $\text{(DFA)}$ with $5$ states that accepts all strings with $0101$ as a substring.
admin
asked
in
Theory of Computation
Dec 15, 2022
by
admin
75
views
drdocse-2022-paper2
theory-of-computation
finite-automata
5-marks
descriptive
0
votes
0
answers
12
This question is from introduction to formal language and automata peter linz 5th edition
Hafeezullah
asked
in
Theory of Computation
Dec 2, 2022
by
Hafeezullah
13
views
theory-of-computation
peter-linz-edition5
regular-language
finite-automata
0
votes
0
answers
13
Theory Of Computation
Can finite automata do addition, subtraction, and multiplication? Anyone, please explain in detail?
raja11sep
asked
in
Theory of Computation
Nov 22, 2022
by
raja11sep
123
views
finite-automata
0
votes
1
answer
14
#GateAppliedCourse-DFA-EpsilonNFA
can we solve it with a minimum of 4 states?
Dknights
asked
in
Theory of Computation
Nov 19, 2022
by
Dknights
98
views
theory-of-computation
finite-automata
number-of-states
0
votes
1
answer
15
Made easy postal course example problem
What will be the DFA for wxw^r where w belongs to (a,b)^+ and x belongs to (a,b)^+
Luci3671
asked
in
Theory of Computation
Nov 11, 2022
by
Luci3671
104
views
theory-of-computation
finite-automata
0
votes
1
answer
16
Theory Of Computation (NFA/DFA)
**MSQ** The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s) 0 1 01 10
Souvik33
asked
in
Theory of Computation
Nov 7, 2022
by
Souvik33
136
views
finite-automata
theory-of-computation
easy
0
votes
1
answer
17
Theory of Computation
b* a* ∩ a*b* = (a U b)* Is this statment wrong or correct ?
moe12leb
asked
in
Theory of Computation
Nov 5, 2022
by
moe12leb
107
views
theory-of-computation
regular-language
finite-automata
0
votes
0
answers
18
Theory of computation
Can finite automata do multiplication.
Overflow04
asked
in
Theory of Computation
Oct 31, 2022
by
Overflow04
102
views
theory-of-computation
self-doubt
finite-automata
0
votes
2
answers
19
#MADE EASY
Is this statement right or wrong? A DFA does not contain a dead configuration. and what is the mean of dead configuration exactly?
Dknights
asked
in
Theory of Computation
Oct 27, 2022
by
Dknights
243
views
finite-automata
theory-of-computation
0
votes
3
answers
20
Regular expression
is a(ba)*=(ab)*a?
nbhatt
asked
in
Theory of Computation
Sep 23, 2022
by
nbhatt
236
views
theory-of-computation
regular-expression
finite-automata
0
votes
0
answers
21
Regular expression
Can we simplify a*+a*b(d+ca*b)*ca* ? Where a,b,c,d are regular expression.
nbhatt
asked
in
Theory of Computation
Sep 21, 2022
by
nbhatt
217
views
theory-of-computation
finite-automata
regular-expression
0
votes
1
answer
22
Conversion of Regular expression to Finite Automata
What is the Finite Automata( NFA, epsilon-NFA or DFA) for the regular expression (a*ba)* ?
dutta18
asked
in
Theory of Computation
Sep 21, 2022
by
dutta18
169
views
theory-of-computation
finite-automata
number-of-dfa
0
votes
1
answer
23
Regular expression
What will be the regular expression for following fa using recurrence relation method.
nbhatt
asked
in
Theory of Computation
Sep 21, 2022
by
nbhatt
140
views
theory-of-computation
regular-expression
finite-automata
2
votes
3
answers
24
Regular expression
Is (a+ab*b)* and (ab*)* same or not?
nbhatt
asked
in
Theory of Computation
Sep 15, 2022
by
nbhatt
320
views
theory-of-computation
regular-expression
finite-automata
Page:
1
2
3
4
5
6
...
33
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Central Pollution Control Board CPCB Various Post Recruitment 2023
MP Rajya Sahkari Apex Bank Various Post Recruitment 2023
NITIE MUMBAI throgh GATE
PGCIL recruitment 2023 – Apply Online For 138 Posts through GATE
Admission guidance for GATE CSE 2023
Subjects
All categories
General Aptitude
(2.6k)
Engineering Mathematics
(9.4k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(655)
Exam Queries
(847)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(866)
Recent questions tagged finite-automata
Recent Blog Comments
Please see the updated link.
Unfortunately there won't be a hardcopy coming...
this book is not available on amazon now, i want...
Yes
Hi! @AnkitMazumder14 bhaiya,Is python...