Skip to content
/ DFA Public

Program that receives the description of a language that corresponds to a DFA, then asks for a string thus to see if it is accepted by the DFA or not.

Notifications You must be signed in to change notification settings

meramos/DFA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 
 
 

Repository files navigation

The program reads the specifications for the language from a given text file. 
In this text file, the first line corresponds to the states of the DFA, the 
second line corresponds to the alphabet, the third line corresponds to the 
transition function, the fourth line corresponds to the initial state and the 
fifth line corresponds to the final states.

The elements for each should be separated by a space. 

For the data in example_input, q1, q2 and q3 are the states of the DFA; 0 and 
1 are the elements of the alphabet, the following table represents the stated 
transition function:

 
  |  0  1
---------
q1| q1 q2
q2| q3 q2
q3| q2 q2

q1 is the initial state and q2 is the final state.

About

Program that receives the description of a language that corresponds to a DFA, then asks for a string thus to see if it is accepted by the DFA or not.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published