files nfa to fda - open to bidding

DESCRIPTION The project involves the development of a program in C or C ++ language, which will read the definition of a non-deterministic finite automaton with epsilon transitions, and assuming is, the conversion algorithm AFN to AFD will apply. With the AFD generated, it must be to validate strings which will be entered from the keyboard, producing as output the recognition or not. DEFINITION The program will be powered by an input file, which will contain the definition a non-deterministic finite automaton with epsilon transitions. Once loaded this information, the program should generate a deterministic finite automaton, based on the AFN previously loaded. When converting to AFD, generate an output file with the formal definition of AFD, this file should be called "AFD.TXT". At this point, the program will enter line mode command, in this mode can be entered by keyboard strings, which must be validated against AFD previously calculated, generating a message indicating that the chain was correctly recognized or not. In this mode, you can enter as many strings as the user wants, ending the execution of this ESC. The $ symbol represents the empty string. INPUT FILE FORMAT The input file contains the definition of an NFA-є using the following format: S = {state1, state2, State3, ..., estadon} So state1 = {} T = {state1, state2, State3, ..., estadon} A = {simbolo1, simbolo2, simbolo3., ...} F (state1, símbolo1) = {state1, state2, ...} FILE FORMAT OUTPUT You can generate in the same format as

Programowanie w C++

Numer ID Projektu: #6416991

O projekcie