Non-Deterministic Finite Automaton

i need an NFA that read its start state, final state(s), transition function, number of states, language from txt [url removed, login to view]'ll look like this in txt file: 4 > number of states 0 1 e > language 0 01 0 > 2 - 2 >>> transition - 3 - > 3 3 - > 0 > start 3 > final it will take input string from user. also, it will write the steps it [url removed, login to view], writes if the input string is accepted or not. it's accepted if it is written in C/C++. and i need this program friday morning.

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.

2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):

a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.

b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.

3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).

## Platform

windows xp visual studio 2005

Programación en C

Nº del proyecto: #3929541

Sobre el proyecto