A toolbox for automaton theory, language theory, lambda calculus, propositional logic, and formal semantics. Including simulations, applications, parsers, and algorithm implementations.
- Finite State Machine
- Minimize finite state machine
- Convert Non-deterministic FSM to Deterministic FSM
- Convert FSM to regular expression
- FSM simulation
- FSM Union, Intersection, and Difference
- FSM Reverse, Complement, and Kleen
- FSM language subset, infinite, and empty
- FSM to Regular Grammar
- FSM enumeration
- Regular Expression
- Convert regular expression to FSM
- Parse regular expression from string
- Regular expression simulation
- Regular expression simplification
- Regular expression enumeration
- Context-free Grammar
- Context-free Grammar simulation
- Context-free Grammar parsing
- Pushdown Automaton
- Turing Machine
- Propositional Logic
- Truth Tables
- Truth-functional connectors
- Material-implication and bi-implication
- Set theory inference and prove
- Lambda Calculus
- Formal Semantics
- Natural Logic and Monotonicity
npm start run