📝 Minimize Finite State Machines 📝

A finite state machine consists of: ❗

• Finite sets S, R y Q, where S is a finite input alphabet, R is a finite output alphabet and Q is a set of states.
• A state transition function f that gives the next state of M in terms of the current state and the next input symbol.
• An output function g that gives the next output symbol of M in terms of the current state and the next input symbol.
• A predetermined initial state q(0) = q1, where q1 ∈ Q, in which M is placed prior to instant t = 0.

Mealy Machine 📚

Definition:

A transition assigned finite-state machine is 6−tuple where:

• Q is a finite set of internal states
• S is a finite input alphabet
• R is a finite output alphabet
• f is the state transition funcion f : Q × S −→ Q g is the output function g : Q × S −→ R
• q1 ∈ Q is the initial state

Moore Machine 📚

Definition

A state assigned finite-state machine is 6−tuple donde:

• Q is a finite set of internal states
• S is a finite input alphabet
• R is a finite output alphabet
• f is a state transition functionf :Q×S−→Q h is an output function h : Q −→ R
• q1 ∈ Q is the initial state

Application ✅

🔗 Link: https://lively-mud-06c994510.1.azurestaticapps.net

Description

This application allows us to verify if an automatan is connected, and then find its reduced machine (if it is the case).

The inputs we need:

• Select if we are going to introduce a Mealy machine or Moore machine.
• The alphabet.
• The number of states.
• Fill the table with all transitions and outputs. ‼️ Important ‼️ The cells of the table can not be in edit mode, because pressing the submit button will show an alert like this.
  

Capture of the app ➡️

Output ✔️

Tools used to create this proyect:

• React - MaterialUI
• Java
• Spring
• Docker
• Kubernetes