# theoinf
A crate for various topics from theoretical computer science.
Currently, there are parsers and interpreters for the following topics:
- set theory
- propositional logic
- deterministic finite automata
More will follow.
## set theory
All the usual operations of naive set theory are implemented.
## propositional logic
All the usual operations of propositional logic are implemented.
The result struct contains the truth table and more information about the formula.
## deterministic finite automata
A DFA can be defined and words can be tested for acceptance.