the details of how the data is represented in the computer are hidden

each piece of data is broken down into its binary equivalent

all the bytes of data are placed in an abstract tree structure for easy retrieval

the concept of how data is contained is philosophically approached

the breaking down a problem into smaller parts (sub-problems), each of which perform a specific task

the construction of an overall blueprint of the program, including methods and functions

the creation of the layout of pseudocode that can be converted to a composition diagram

the adjustment of the code to enable parallel processing of what might be sequential programming statements

reducing down to problems that have been solved

removing the more challenging aspects of the problem

recalculating the more challenging algorithms until the problem does not exist

re-calibrating the key criteria of the issue until the symptomatic criteria have been neutralised

modelling and design of computer programs as well as digital hardware systems

showing notation for context-free grammars, describing the syntax of languages

providing tools to facilitate communication, measurement, commerce and manufacturing

knowing the framework around technology integration

State, Start state, Accept state and transition

State, Slow state, Fast state and Progression

Start, Go state, Stop state and Halt

Begin state, Engage state, Process and Halt

Mealy Machine

Finite State Machine with Output

Mechanical Machine

Making Machine

<digit> ::= 0|1|2|3|4|5|6|7|8|9

R → (B → 5)

x + y2 → 17

x2 + 3y

Definitive

Terminal

Non-terminal

Special

Definitive

Terminal

Non-terminal

Special

< Name> ::= < Name >

<Name> =:: <Forename> | <Surname>

<Name> ::= <Forename> <Surname>

<Name> ::= <Forename Surname>

Backus-Naur form supports definitions

Backus-Naur form supports Recursion

Backus-Naur form supports Selection

Backus-Naur form supports Loops

<Number> ::= <Digit> | <Digit><Number>

<Name> ::= <Forename><Surname>

<Age> ::= <Digit>|<Digit><Digit>

<Name> ::= <Name>

To create complex mathematical equations

To check language syntax and formulate simple production rules

To design user interfaces

To compile programming languages

Notating context-free languages.

Notating context-sensitive languages.

Notating regular languages.

Notating linear languages.

The OR operator.

The AND operator.

The NOT operator.

The XOR operator.

To simplify expressions

To form more complex definitions

To eliminate non-terminals

To avoid using regular expressions

As a digit or a digit followed by a letter

As a digit or a digit followed by an integer

As a letter or a letter followed by a digit

As a letter or a letter followed by an integer

A visual representation of a regular language

A textual representation of a regular language

A visual representation of a programming language

A textual representation of a programming language

Finite State Automaton

Counter machines

Universal Turing Machine

All of the above

Demonstrate the ability of humans to build computers

Provide a definition of what is computable

Used to prove that there are problems which cannot be solved by computers

Allow for the completion of complex mathematical calculations

δ(current state, write) = (new state, read, move)

δ(current state, read) = (new state, write, move)

δ(new state, read) = (current state, write, move)

δ(current state, read, new state,) = ( write, move)

have a polynomial (or less) time solution

have no polynomial (or less) time solution

1, L

1, R

0, L

0, R