https://github.com/alejandro945/states-machine-client
Behavior model of a system with inputs and outputs where the outputs depend not only on current input signals, but also on previous ones.
https://github.com/alejandro945/states-machine-client
azure-devops clusterip ingress-nginx kubernetes-cluster registry-cli
Last synced: 9 months ago
JSON representation
Behavior model of a system with inputs and outputs where the outputs depend not only on current input signals, but also on previous ones.
- Host: GitHub
- URL: https://github.com/alejandro945/states-machine-client
- Owner: alejandro945
- Created: 2022-09-16T01:13:27.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2022-10-02T16:56:41.000Z (almost 4 years ago)
- Last Synced: 2024-12-27T02:14:04.454Z (over 1 year ago)
- Topics: azure-devops, clusterip, ingress-nginx, kubernetes-cluster, registry-cli
- Language: JavaScript
- Homepage:
- Size: 519 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
:pencil: Minimize Finite State Machines :pencil:
## A finite state machine consists of: :heavy_exclamation_mark:
* 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 :books:
### 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 :books:
### 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 :white_check_mark:
:link: 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. :bangbang: **Important** :bangbang: 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 :arrow_right:
### Output :heavy_check_mark:
# Tools used to create this proyect:
* React - MaterialUI
* Java
* Spring
* Docker
* Kubernetes