finite automata

Expand Post »

Hey people, I need help with this one:

build a finite NON deterministic automata that accept the next language:

language of all the words on {0,1,2} from the form: w=w1w2w3 that keep:
w1 belongs to 0*
w2 belongs to 1*
w3 belongs to 2*
|w| is even

thank you !

Similar Threads

Translate an algorithm to C program in C
i need deterministic finite automata C program in C
create non deterministic finite automaton in Computer Science
Finite Automata in IT Professionals' Lounge

Den Watts

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

4 posts
since Oct 2004

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in Computer Science Forum Timeline: subscription help

Next Thread in Computer Science Forum Timeline: Source Control Review

DaniWeb Message

Cancel Changes

User Name
Password