A DFA is a deterministic finite automaton, a simple model of computation. It is one way to model regular languages. Each DFA consists of a finite set of states and a transition function between those states describing how the state of the machine changes in response to new input. DFAs are closely related to regular expressions in the sense that they can be converted into each other. Thus, DFAs are often used to implement regular expression matchers.
Questions tagged [dfa]
569 questions
-2
votes
1 answer
Regular Language to DFA conversion
I ran into a problem in a textbook that I can't decipher and I was hoping you could help. I'm not asking for a solution, just a translation, or a push in the right direction. This is in the JFLAP textbook.
The alphabet consists only of "a".
{a^L |L…
ReezaCoriza
- 133
- 4
- 16
-2
votes
1 answer
Looking for a BNF to DFA conversion tool
Is there a tool that can receive BNF grammar as input and produce a DFA from it?
I have already found the 'hackingoff' tool in here: http://hackingoff.com/
But it is more of a testing tool and does not work on large grammars.
Vahid
- 257
- 4
- 14
-2
votes
1 answer
How to write a C program for Unix that can process the Regular Expression ?
I want creat a C program for Unix that can porcess the Regular Expression,like a simple Perl interpreter. Do I have to personally write an regexp engine?
Ghjhdf
- 161
- 8
-3
votes
1 answer
(T/F) Given an NFA that has null/epsilon transitions, one can create another NFA that accepts the same language but has NO null-transitions
True or false and say why:
Given an NFA that has null/epsilon transitions, one can create another NFA that accepts the same language but has NO null-transitions.
Collin
- 394
- 5
- 14
-3
votes
1 answer
Verify wether the following answer is correct?
I am asked to write the grammar which generate the following language over the alphabet Z={a,b}
M={w | numbers of b's in w is 3 modulo 4}
My Answer is
S->bP| bJ | aS
P->bQ | bK | aP
Q->bR | bL | aQ
R->bS | e | aS
L->e
will this work?
Can we make it…
GraduateStudent
- 113
- 5
-3
votes
1 answer
Please help me covert the dfa to regular expression
i don't know how to use algorithm to covert this dfa to regular expression. Please help me.
cyshes21
- 11
- 4
-3
votes
1 answer
Deterministic Finite Automata with 6 states
I am really new to this and to sure how to start. I am trying to do this question for practice
Let segma = {a,b}. Consider the set of all strings in segma* that have an odd
number of occurrences of the substring "ab" but do not have "bb" as a…
Alex
- 23
- 1
- 6
-4
votes
4 answers
DFA that contains 1011 as a substring
I have to draw a DFA that accepts set of all strings containing 1011 as a substring in it. I tried but could not come up with one. Can anyone help me please?
Thanks
DrunkOnBytes
- 29
- 2
- 3
-4
votes
2 answers
Convert This NFA to DFA
I'm having trouble understanding how to convert.
I made a state table for NFA but
This alphabet instead of (a,b) makes me confused.
Can anyone help me how to convert this NFA to DFA?
alongova
- 35
- 5
-4
votes
1 answer
Designing DFA to accept language of even length beginning with 11
Design a DFA to accept language L={w|w is of even length and begins with 11} where inputs are 0'a and 1's?
Raksha
- 13
- 1
- 7
-5
votes
3 answers
(T/F and explain) An NFA accepts the empty string if and only if its start state is a final state
Does an NFA accept an empty string if and only if its start state is a final state? Is this true?
Please explain why.
This question is related to Automata and NFAs and DFAs.
Collin
- 394
- 5
- 14
-5
votes
2 answers
Theory of Computation can't design a DFA
hello guys can you help me with this question i can't solve it on my own
consider a language over the alphabet Σ={a,b,c} with all strings with a's never preceded by b's and never followed by c's . Design and implement a DFA that would accept this…
adams HowTo
- 7
- 1
-6
votes
3 answers
Regular expression [ 1 ( 0 1* 0)* 1 ]* DFA
What are the conditions for the chain to be accepted by this regular expression?
Brandon Garcia
- 64
- 2