Skip to content### Category: Computational logic

## Finite State Machine – DFA – Regular Expression – Example 2 ☠☠

## Finite State Machine – DFA – Regular Expression – Example 5 ☠☠

## Finite State Machine – DFA – Regular Expression – Example 3 ☠☠☠

## Finite State Machine – Converting NFA to DFA – Deriving Regular Expression – Example 4 ☠☠☠

## Finite State Machine – DFA – Regular Expression – Example 1 ☠☠

## PL to Conjunctive Normal Form (CNF): ((not (A xor B)) implies C) ☠☠

## PL to Conjunctive Normal Form (CNF): (if A then B else (C implies D)) ☠☠

## PL to Conjunctive Normal Form (CNF): ((P and R) xor (S or T)) ☠☠☠

## PL to Conjunctive Normal Form (CNF): (T implies (P or Q)) ☠

∞ 2019 I Had a Crack at it, ihadacrackatit.com | Last modified: 21st August 2019

**Collaborative Network**

Made with & in Nora (Sweden), Karlovy Vary (Czech Republic) and Edinburgh (Scotland)