Software Engineer Training » Telecommunicatins Software Design and Analysis http://www.software-engineer-training.com Requirements, Architecture, Design, Development, Testing, Quality and Maintenance Wed, 18 Jan 2012 18:47:43 +0000 en hourly 1 http://wordpress.org/?v=3.2.1 Propositional Logic Rules http://www.software-engineer-training.com/telecommunicatins-software-design-and-analysis/propositional-logic-rules/ http://www.software-engineer-training.com/telecommunicatins-software-design-and-analysis/propositional-logic-rules/#comments Sun, 04 Nov 2007 18:32:54 +0000 admin http://www.software-engineer-training.com/telecommunicatins-software-design-and-analysis/propositional-logic-rules/ Commutative Law:

Commutative Law Propositional Logic

Commutative Law Propositional Logic

Associative Law:

Associative Law Propositional Logic

Associative Law Propositional Logic

Distributive Law:

Distributive Law Propositional Logic

Distributive Law Propositional Logic

Tautology Law:

Tautology Law Propositional Logic

Tautology Law Propositional Logic

Absorption Law:

Absorption Law Propositional Logic

Absorption Law Propositional Logic

Demorgan’s Law:

Demorgan’s Law Propositional Logic

Demorgan’s Law Propositional Logic

Double Complementation:

Double Complementation Law Propositional Logic

Implication:

Implication Law Propositional Logic

Complementation:

Complementation Law Propositional Logic

Complementation Law Propositional Logic

Disjunction:

Disjunction Law Propositional Logic

Disjunction Law Propositional Logic

Conjunction:

Conjunction Law Propositional Logic

Conjunction Law Propositional Logic

—

[1] – Images from Thomas Jefferson High School for Sciene and Technology

]]> http://www.software-engineer-training.com/telecommunicatins-software-design-and-analysis/propositional-logic-rules/feed/ 1 Deterministic Finite State Automaton (DFA) http://www.software-engineer-training.com/telecommunicatins-software-design-and-analysis/deterministic-finite-state-automaton-dfa/ http://www.software-engineer-training.com/telecommunicatins-software-design-and-analysis/deterministic-finite-state-automaton-dfa/#comments Sun, 04 Nov 2007 15:34:32 +0000 admin http://www.software-engineer-training.com/telecommunicatins-software-design-and-analysis/deterministic-finite-state-automaton-dfa/ A deterministic finite state automaton (DFA) is a simple language recognition device. It can be seen as a state machine where for each pair of state and input symbol there is one and only one transition to a next state. It will take in a string of input symbols and then for each symbol it will transition to another state according to a transition function. More about DFA can be found here.

Examples from [1]:

1) Construct a DFA to accept a string containing a zero followed by a one.

Construct a DFA to accept a string containing a zero followed by a one

2) Construct a DFA to accept a string containing two consecutive zero’s followed by two consecutive ones.

Construct a DFA to accept a string containing two consecutive zero’s followed by two consecutive ones

3) Construct a DFA to accept a string containing even number of zeros and any number of ones.

Construct a DFA to accept a string containing even number of zeros and any number of ones

4) Construct a DFA to accept all stings which do not contain three consecutive zeros.

Construct a DFA to accept all stings which do not contain three consecutive zeros

5) Construct a DFA to accept all strings containing even number of zeros and even number of ones.

Construct a DFA to accept all strings containing even number of zeros and even number of ones.

6) Construct a DFA to accept all strings which satisfy #(x)mod5=2.

Construct a DFA to accept all strings which satisfy #(x)mod5=2

7) Construct a DFA to accept all strings (0+1)* with an equal number of zeros and ones such that each prefix has at most one more zero than ones and at most one more one than zeros.

Construct a DFA to accept all strings (0+1)* with an equal number of zeros and ones such that each prefix has at most one more zero than ones and at most one more one than zeros

—

[1] – Model Engineering College –

]]> http://www.software-engineer-training.com/telecommunicatins-software-design-and-analysis/deterministic-finite-state-automaton-dfa/feed/ 4