Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/danfalcon225/dfa_simulation
A program simulates DFA behaviour.
https://github.com/danfalcon225/dfa_simulation
dfa eclipse-ide java
Last synced: about 1 month ago
JSON representation
A program simulates DFA behaviour.
- Host: GitHub
- URL: https://github.com/danfalcon225/dfa_simulation
- Owner: DanFalcon225
- Created: 2022-06-03T22:49:19.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2022-06-03T23:08:24.000Z (over 2 years ago)
- Last Synced: 2024-04-22T20:34:17.769Z (9 months ago)
- Topics: dfa, eclipse-ide, java
- Language: Java
- Homepage:
- Size: 8.79 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# DFA_simulation
Current program simulates DFA behaviour which is aim to process a defined language.
∑ = {E,G,L,O,X}
L = {w ∈ Σ*: w contains sub word with any number of Os between G in front and GLE at the back of the sub word}In our case language is consisted of five letters over alphabet, however
apart of language itself we also have a sub word. Sub word states that language must
contain any number of Os between G in front and GLE at the back of the sub word.By analysing mentioned sub word, we can see relevant transitions for G, O, G, L, E
(as language accept any number of Os we represent transition O as a loop).The below picture demonstrates relevant transition diagram for named DFA (DFA is in minimized form)
The below picture shows relevant tests using configuration sequence:
Program itself consisted of two classes, first one is responsible for inner logic of DFA and
second one is responsible for accepting a user input, pass it through the other class and print out the
result to the user.Program is using a table-driven method to implement named DFA. In order to apply
to a table approach into the program itself a multidimensional array needs to be used.
Multidimensional array acts as a table and it is aim to store all transitions of the diagram.
Each row of the 2D array is stands for the state and each element stored into the row for transition.