Stack Overflow
Stack Overflow

Questions tagged [nfa]

An NFA is a nondeterministic finite automaton, a mathematical model of computation that decides membership in regular languages.

An NFA is a nondeterministic finite automaton, a mathematical model of computation that decides membership in regular languages.

It is similar to a DFA except that it is nondeterministic, and the machine can be in multiple states simultaneously. Some definitions of NFAs also allow for e-moves, in which the automaton can transition between states on no input at all.

It is known that for every NFA there is also DFA that expect the same language, thus their computation streangh is identical.

310 questions
-2
votes
1 answer

Regular Expression | Automata Theory

does anyone know about regular expressions of the following languages: the set of all strings starting with 000 and not ending 11 the set of all strings with odd string length and ending in 111 L6 is the set of all strings ending in 00 and…
Apriana
  • 1
-2
votes
2 answers

a*b* and (ab)* same or not?

are a*b* and (ab)* the same language? I am trying to make nfa for a*b*
user11239824
-2
votes
1 answer

From a regular expression to NFA and to DFA

I have the following regular expression: [A−Z]∗01∗[^A−Z]{3} The alphabet is [A-Z][0-9]. Can someone explain the correct way to convert to a NFA and then to DFA. And how can I implement the epsilon closure in C.
Nedo
  • 15
  • 5
-2
votes
1 answer

Automaton for prefix matching

Using an open source Java automaton library, eg: org.apache.lucene.util.automaton or dk.brics.automaton, how can I build an automaton for prefix matching? eg: an automaton created from the set of strings ["lucene", "lucid"], that will match when…
tekumara
  • 8,357
  • 10
  • 57
  • 69
-2
votes
1 answer

Find the DFA for the language L given

L is a language over {x,y,z} where x's are never preceded by y's and never followed by z's
Aastha Dahal
  • 329
  • 2
  • 11
-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
-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
-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
1 2 3
…
20
21