Regular Machines

Question 1

What are the tuples for a regular emitter machine?

Answer 1

G :: = < Q, q₀, Γ, λ, δ, F >

Q = finite set of all states the machine goes through

q₀ = initial state
Γ = set of symbols the machine uses to construct output string

λ = Q → Γ; output function that prescribes (lays down the rule for) the output of the machine at its current state

δ = state transition function

F = final state

Question 2

What are the kinds of regular machines?

Answer 2

1. Partial regular machine
2. Total regular machine

Question 3

What are the types of Partial regular machines?

Answer 3

1. Regular Acceptor Automata
2. Regular Emitter Automata

Question 4

What is a state?

Answer 4

A state is an internal configuration an agency may assume during its operation.

Question 5

What is a home state?

Answer 5

A home state is the state an agency prefers to stay in.

Question 6

What is a cell?

Answer 6

A cell is a placeholder for a single bit.

Question 7

What is a register?

Answer 7

A register is a placeholder structure.

Question 8

What is a Regular Acceptor Automata? (Explanation)

Answer 8

An automata that reads or accepts an input string. It has no output, but changes its state to a final state after processing the last symbol in the string.

Question 9

What is the formal definition (tuples) of a Regular Acceptor Automata?

Answer 9

It is defined as five tuples, which are
RAA::= <Q, q_o Σ, δ, F>

Q = countable set of all states the machine goes through

q_o = the initial state

Σ = set of valid symbols the machine can accept

δ = is a transition function which prescribes the transition from the machine’s current state to another state on processing the input symbol

F = countable set of final states

Question 10

What is the design of the formulation of a Regular Acceptor Machine?

Answer 10

Here

Question 11

What is the design of the structure of a Regular Acceptor Machine?

Answer 11

Here

Question 12

List the steps in designing an abstract machine.

Answer 12

A: Understand the problem
* Give the machine a name
* Construct the narrative of the machine
* You can design the grammar here.

B: Process Identification
* Identify the input and output
* Identify the state and transition
* Assignment symbols to the inputs and outputs for regular machine

C: Automata formulation
* Construct and explain the formula for the formal representation of alphabet, states, and transition function.

D: Machine Design
* Represent components and operations of the machine using State Diagram

E: Machine Simulation
* Explain how the machine processes certain input cases using the Machine Process Execution Table

F: Evaluate or improve
* Determine if the machine runs as expected.