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 - automaton

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

Posts

Questions

Blogs

Jobs