python (65.2k questions)

javascript (44.3k questions)

reactjs (22.7k questions)

java (20.8k questions)

c# (17.4k questions)

html (16.3k questions)

r (13.7k questions)

android (13k questions)

Questions - nfa

A NFA accepting ;anguages whose final digit didn't appear before

Give a non-deterministic finite automata(NFA) which accepts the following language: The set of strings over the alphabet {0,1,...,9} such that the final digit has not appeared before. I have encounter...
test-img

Rui R

nfa

non-deterministic

automaton

Votes: 0

Answers: 2

Latest Answer

When the alphabet is {0,1}, which is the simplest non-trivial situation, we can get a simplest NFA like this: The simplest non-trivial situation So further you can get an NFA like this: enter image de...
test-img

Rui R

Store NFA into data structure

I am provided with a NFA and I need to use a data structure (I can not use recursive descent parser) for storing it. Once the NFA is stored in a data structure I am given a string to check if the stri...
test-img

Orion

parsing

data-structures

lex

dfa

nfa

Votes: 0

Answers: 1

Latest Answer

An NFA is just a set of triples State x Input -> State. It's usually convenient to represent a State with a small integer in a consecutive range starting at 0 (or some other defined starting point)...
test-img

rici

What is the language accepted by this NFA? Can you express it in English and with regular expression?

I have been trying to solve this NFA, this below it is the best I could come up with. I have hard time describing in English the language it produces, can someone help me to understand better? Regula...
test-img

giacomo venturelli

regex

nfa

Votes: 0

Answers: 1

Latest Answer

You can see that you only have 0s going into the accepting state, which means the pattern has to end with a 0. You also see that you need to have at least one 1, otherwise you will be stuck in the sta...
test-img

rudolfovic

How to deal with epsilon transitions while converting NFA to DFA?

The start state(S0) of my NFA has 2 outgoing epsilon transitions to S1 and S2, and, S1 and S2 have further transitions, and are disjoint of each other. So do I consider {S1,S2} as one state while conv...
test-img

shardul

finite-automata

dfa

nfa

Votes: 0

Answers: 1

Latest Answer

The start state(S0) of my NFA has 2 outgoing epsilon transitions to S1 and S2. S1 and S2 have further transitions, and are disjoint of each other. We consider {S1,S2} as one state while converting €-N...
test-img

Ramyasri Koda

Posts

Questions

Blogs

Jobs