Finite State Machine – DFA – Regular Expression – Example 2 ☠☠ Posted on 19th December 201920th December 2019 Petr StejskalLeave a commentPosted in Computational logic, Finite State Machines
Finite State Machine – DFA – Regular Expression – Example 5 ☠☠ Posted on 19th December 201920th December 2019 Petr StejskalLeave a commentPosted in Computational logic, Finite State Machines
Finite State Machine – DFA – Regular Expression – Example 3 ☠☠☠ Posted on 19th December 201920th December 2019 Petr StejskalLeave a commentPosted in Computational logic, Finite State Machines
Finite State Machine – Converting NFA to DFA – Deriving Regular Expression – Example 4 ☠☠☠ Posted on 19th December 201920th December 2019 Petr StejskalLeave a commentPosted in Computational logic, Finite State Machines
Finite State Machine – DFA – Regular Expression – Example 1 ☠☠ Posted on 19th December 201920th December 2019 Petr StejskalLeave a commentPosted in Finite State Machines
PL to Conjunctive Normal Form (CNF): ((not (A xor B)) implies C) ☠☠ Posted on 21st August 201921st August 2019 Petr StejskalLeave a commentPosted in Computational logic, Propositional Logic
PL to Conjunctive Normal Form (CNF): (if A then B else (C implies D)) ☠☠ Posted on 21st August 201921st August 2019 Petr StejskalLeave a commentPosted in Computational logic, Propositional Logic
PL to Conjunctive Normal Form (CNF): ((P and R) xor (S or T)) ☠☠☠ Posted on 21st August 201921st August 2019 Petr StejskalLeave a commentPosted in Computational logic, Propositional Logic
PL to Conjunctive Normal Form (CNF): (T implies (P or Q)) ☠ Posted on 21st August 201921st August 2019 Petr StejskalLeave a commentPosted in Computational logic, Propositional Logic