3.1 Finite Automata

Question 1

What is a finite automata

Answer 1

A state machine which produces an output determining whether the string is in the lanugage or not

Question 2

What is a finite automata for a string containing an even / odd amount of a’s (allphabet = {a,b})

Answer 2

Accepting state circled twice

Question 3

How to derive final state based on finite automata (show working method)

Answer 3

Start in starting state then progress based on each element of alphabet

This is called a run

Question 4

What is a finite automata for identifying a double ‘aa’ in a string

Answer 4

Question 5

What are the 5 parameters that compose a deterministic finite state automaton

Answer 5

Transition specifies new state based on current state and input (cartesian product = all possibilities / arrows)

Question 6

What is the formal definition of what a run is in DFA

Answer 6

Question 7

What is a language produced by a DFA

Answer 7

Question 9

What is a DFA for recognising a string with both an even amount of a’s and a double a (“aa”)

Answer 9