|
| 1 | +export enum HelpDetails { |
| 2 | + HowToCreateAutomaton = ` |
| 3 | + To create an automaton, there are two options. |
| 4 | + Either states can be dragged in the canvas and connected through transitions filling the transition table automatically, |
| 5 | + or transition table can be filled manually creating states and their respective transitions automatically. |
| 6 | + Both options can be used simultaneously.`, |
| 7 | + |
| 8 | + HowToDownloadAutomaton = ` |
| 9 | + To download automaton, click on Tools > Download automaton. |
| 10 | + A file will be downloaded with the automaton in JSON format.`, |
| 11 | + |
| 12 | + HowToUploadAutomaton = ` |
| 13 | + To upload automaton, click on Tools > Upload automaton. |
| 14 | + Select your desired file. |
| 15 | + The automaton will be uploaded and you continue your work.`, |
| 16 | + |
| 17 | + HowToCheckIfAutomatonIsDFA = ` |
| 18 | + To check if automaton is DFA, click on Tools > IsDFA. |
| 19 | + An automaton is considered a DFA if it has one initial state, final state(s), and exactly |
| 20 | + two transitions for each state i.e. a and b transitions. if any state has missing or null |
| 21 | + transition, it won't be considered as a DFA.`, |
| 22 | + |
| 23 | + HowToCheckIfAutomatonIsNFA = ` |
| 24 | + To check if automaton is NFA, click on Tools > IsNFA. |
| 25 | + An automaton is considered a NFA if it has one initial state, final state(s), multiple |
| 26 | + "a" and "b" transitions, missing or null transition(s).`, |
| 27 | + |
| 28 | + HowToHighlightNullTransitions = ` |
| 29 | + To highlight null transitions in an automaton, click on Tools > Highlight null transitions. |
| 30 | + This will highlight all the null transitions in automaton.`, |
| 31 | + |
| 32 | + HowToConvertNFAtoDFA = ` |
| 33 | + To convert NFA to DFA, click on Tools > Convert NFA to DFA. |
| 34 | + This process requires an already built NFA. |
| 35 | + The process first creates a null closure table to demosntrate null closure of each state. |
| 36 | + Then a modified transition table is created where every state in transition label is replaced by its null closure. |
| 37 | + The process is then followed by transition table for resultant DFA where null null closure of initial state becomes the initial state of DFA. |
| 38 | + New state is added whenever their is a new transition label. The process completes when all the states are added to the table. |
| 39 | + The process is demonstrated in the video below. |
| 40 | +
|
| 41 | + 1. Null Closure |
| 42 | + 2. Modified Transition Table |
| 43 | + 3. Resultant DFA`, |
| 44 | + |
| 45 | + HowToMinimizeDFA = ` |
| 46 | + To minimize a DFA, click on Tools > Minimize DFA. |
| 47 | + This process requires an already built DFA. |
| 48 | + The process is started with a table containing rows and columns equal to the number of states of DFA. |
| 49 | + In the first step, all the diagonal entries are marked with "tick". |
| 50 | + In the second step, all the upper triangle cells are marked with "dash". |
| 51 | + In the third step, all the cells containing one final and one non-final state are marked with a "cross". |
| 52 | + After that, the remaining cells are checked one-by-one for their a and b transitions. |
| 53 | + If the cell lead by a or b transition is marked with cross, it is marked with a cross. |
| 54 | + Or if both cells lead by a and b transitions are marked "tick", then current cell is also marked with a tick. |
| 55 | + Otherwise left empty. |
| 56 | + This process continues for all the cells. |
| 57 | + After that, next iteration is performed following the last mentioned step. |
| 58 | + If the table remains same across two iterations, then blank cells are marked with a "tick". |
| 59 | + After that, minimized DFA is created with states being merged according to the ticks in each row of the table.`, |
| 60 | + |
| 61 | + HowToTestAStringOnAutomaton = ` |
| 62 | + To test a string on automaton, click on Tools > test a string. Enter a valid string. |
| 63 | + Select animation duration and click play. The animation will start highlighting the path |
| 64 | + of each character. Note that if there are null transitions in the automaton, string will go through |
| 65 | + them and continue their path after the null transitions.`, |
| 66 | +} |
0 commit comments