Overwhelmed...? Bored...? → Join discussions group or tell us what you like and dislike by taking a → 3-minute survey.
Define initial state s0, final states F and input word in declarations.
Hint: Combine rules on left side, right side or both:
→ More help for 'FSM'...
or 'from s0 reading nothing...' as: (s0, lambda, k) => (s1, abck);
Define initial state s0, final states F, stack symbol kSymb and input word(s) in declarations.
→ More help for 'PDA'...
Define initial state s0, final states F, blank tape symbol and input word(s) in declarations.
→ More help for 'Turing'...
Grammars can have two modes (grammar tree or parse tree).
Note that the empty word is called epsilon, not lambda, in grammars.
→ More help for 'Grammar'...
Example: (((((a+b).b)*.c).d)+O)which is equivalent to: ((a+b)b)*cd
The output is automatically simplified in some basic ways. To simplify the script, click simplify (a little) .
→ More help for 'RegularExpression'...
→ More help for 'Tree234'...
→ More help for 'RedBlackTree'...
Give the variable names in the beginning as a,b,c,...
→ More help for 'BDD'...
→ More help for 'Huffman'...
→ More help for 'LogicCircuit'...
→ More help for 'Numbers'...
If formulaMode=true is set in the declarations, assume being in Latex math mode, and avoid all the stuff around it.
Latex code can be generated from all Latex-based scripts by clicking the plain generator code button.
Note that, so far, only the 'dot' processor can be used.