menu
Recent questions tagged dfas
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged dfas
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged dfas
0
votes
0
answers
29
views
Introduction to logic circuits and logic design using VHDL, chapter combinational logic design, pg-111.
Noob coder
asked
in
Digital Logic
Sep 2
by
Noob coder
5
points
29
views
digital-logic
combinational-circuits
self-doubt
dfas
peter-linz
0
votes
0
answers
26
views
automata theory & formal language
A DFA for all sets that contains even 0's and even 1's. Instruction: Convert the following DFA into NFA. https://sg.docworkspace.com/d/sIMr0gbhniu7AhwY Instruction: Minimize the following DFA. https://sg.docworkspace.com/d/sIB_0gbhnq_TAhwY Instruction: Give the ... 00. the set of all strings with three consecutive 0's. the set of all string that contains odd 1's.
arce
asked
in
Algorithms
Aug 24
by
arce
5
points
26
views
dfas
0
votes
0
answers
21
views
DFA construction
For E={a,b} construct a dfa for language L where L={w | w has a b in its 2nd last position if such a position exists}????
harshit_1010
asked
in
Theory of Computation
May 2
by
harshit_1010
5
points
21
views
dfas
toc-languages
0
votes
1
answer
49
views
Book: Introduction to formal languages and automata by Peter Linz----Chapter 2: Finite Automata----Exercises
CirrusAlpha
asked
in
Theory of Computation
Apr 21
by
CirrusAlpha
5
points
49
views
dfas
0
votes
1
answer
63
views
SELF DOUBT : What is the minimum DFA for (aa+aaa)* ?
dutta18
asked
in
Theory of Computation
Mar 4
by
dutta18
5
points
63
views
dfas
0
votes
0
answers
36
views
Practise Question from Ulman
Please give the DFA and regular expression
chandra sai
asked
in
Theory of Computation
Feb 4
by
chandra sai
5
points
36
views
dfas
0
votes
0
answers
18
views
An introduction to formal languages and automata
How can I explain that this language- L= { a<sup>n</sup> b<sup>l</sup> : n ≠ l } is not regular. [USE PUMPING LEMMA OR CLOSURE PROPERTIES] This question is under a book named An introduction to ... understandable manner and show how you exactly arrived at the solution? That would be a great help to me. Thanks in advance
kirtipurohit
asked
in
Theory of Computation
Jan 18
by
kirtipurohit
15
points
18
views
toc-languages
peter-linz
grammar
dfas
pumping-lemma
0
votes
0
answers
80
views
An introduction to formal languages and automata peter linz
kirtipurohit
asked
in
Theory of Computation
Jan 16
by
kirtipurohit
15
points
80
views
toc-languages
peter-linz
grammar
dfas
nfa-dfa
0
votes
0
answers
17
views
Peter Linz 5e Ex-2.1 Q-7e DFA
Find DFA on $\Sigma =(a,b)$ for L={ w : $(n_{a}(w)-n_{b}(w))mod3>0$ }
aditi19
asked
in
Theory of Computation
Jan 14
by
aditi19
59
points
17
views
peter-linz
toc-languages
dfas
1
vote
0
answers
39
views
Peter Linz 5e Ex-2.1 Q7e DFA
Find DFA on $\Sigma =(a,b)$ for L={ w : $(n_{a}(w)-n_{b}(w))mod3>0$ }
aditi19
asked
in
Theory of Computation
Jan 14
by
aditi19
59
points
39
views
peter-linz
toc-languages
dfas
0
votes
0
answers
47
views
TIFR 2019 question
https://gateoverflow.in/280484/tifr2019-b-11?show=280805 When i try to do it using State elimination method i got very long Regular expression , can anyone tried to do it using State elimination
Dhruvil
asked
in
Theory of Computation
Nov 28, 2020
by
Dhruvil
11
points
47
views
dfas
0
votes
0
answers
31
views
Ace Theory of Computation CSIT_P_26
Can someone please tell how to solve the below question
Pratyush Priyam Kuan
asked
in
Theory of Computation
Nov 13, 2019
by
Pratyush Priyam Kuan
1.1k
points
31
views
theory-of-computation
dfas
0
votes
1
answer
68
views
Self Doubt: Theory of Computation
What is the difference between intersection and cross product of DFAs? Are they both same?
commenter commenter
asked
in
Theory of Computation
Jul 20, 2019
by
commenter commenter
11
points
68
views
theory-of-computation
dfas
finite-automata
0
votes
2
answers
69
views
TOC-DETERMINISTIC FINITE AUTOMATA
CONSTRUCT A MINIMAL DFA WHICH ACCEPTS SET OF ALL STRINGS OVER {A,B} SUCH THAT 2ND SYMBOL FROM RHS IS ‘A’??? HOW TO SOLVE THIS
Venkateshh
asked
in
Theory of Computation
Jul 8, 2019
by
Venkateshh
5
points
69
views
theory-of-computation
dfas
0
votes
1
answer
28
views
Deterministic finite automata
Consider C1:For $DFA(\phi,\Sigma^*,\delta,q0,F)$ if $F = \phi$ then $L = \Sigma$ closure is it right???
Manmade
asked
in
Theory of Computation
Jul 1, 2019
by
Manmade
5
points
28
views
theory-of-computation
dfas
finite-automata
dfadesign
0
votes
1
answer
38
views
Finite Automata practice
construct minimal dfa over a,b for which each string has 'a' as a 3rd symbol from rhs.
rohitkolapkar
asked
in
Theory of Computation
Jun 27, 2019
by
rohitkolapkar
5
points
38
views
theory-of-computation
dfas
1
vote
1
answer
102
views
#Self doubt How many DFAs are possible?
How many 3 state DFA's can be constructed with a designated initial state that accepts empty language over alphabet {a,b}?
Ravijha
asked
in
Theory of Computation
Jun 25, 2019
by
Ravijha
5
points
102
views
how
many
dfas
possible
To see more, click for the
full list of questions
or
popular tags
.
Ask
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts