Simulador de Autómatas Finitos Deterministas (AFD) y Autómatas Finitos No Deterministas (AFND)
-
Updated
Jan 21, 2020 - Java
#
finite-automata
A finite-state machine (FSM), finite-state automaton (FSA), or simply state machine is a mathematical model of computation and an abstract machine that can be in exactly one of a finite number of states at any given time.
The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition.
An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.
In computer science, FSM are widely used in modeling of application behavior (control theory), design of hardware digital systems, software engineering, compilers, network protocols, and computational linguistics.
Here are 15 public repositories matching this topic...
A JavaFX-based tool for visualizing, editing, and minimizing DFAs (Deterministic Finite Automata), enabling users to efficiently create, optimize, and work with state machines in a user-friendly interface.
visualization java converter algorithm state-machine javafx minimization graph-theory automaton dfa automata-theory dfa-minimization deterministic-finite-automata dfa-converter finite-automata dfa-minimizer
-
Updated
Mar 11, 2025 - Java
A teaching aid for concepts and algorithms in logic
automata logic finite-state-machine temporal-logic logic-programming sat-solver boolean-algebra deterministic ctl bounded-model-checking boolean-logic kripke-structure finite-automata finite-automaton simulation-finite-automaton
-
Updated
Jun 8, 2024 - Java
📋 A regular language recognizer software using Finite Automata
-
Updated
Oct 11, 2022 - Java
Language theory and compilation introduction TPs.
-
Updated
Feb 21, 2021 - Java
Samples of algorithms to verify strings / words using finite machines.
finite-state-machine nfa automaton nda dfa finite finite-automata finite-automaton finiteautomata finitemachine
-
Updated
Jan 12, 2022 - Java
Please read the Design Report.
dfa formal-languages automata-theory deterministic-finite-automata deterministic-finite-automaton dfa-construction finite-automata
-
Updated
Jan 22, 2024 - Java
-
Updated
May 23, 2023 - Java
This project aims to simplify regular expressions using unique identifiers for equivalent expressions. It integrates various representations of regular languages and provides efficient algorithms for simplification and conversion. The system includes an additional layer for optimizing expression size using a Union-Find structure.
regular-expressions regular-languages deterministic-finite-automata finite-automata efficient-data-structures simplification-of-regular-expressions comparison-of-regular-expressions derivatives-of-regular-expressions equivalence-of-regular-expressions extended-regular-expressions minimal-deterministic-finite-automata operations-on-regular-languages regular-equation-systems imperative-programming-with-java
-
Updated
Jul 30, 2024 - Java
A simple state machine library.
-
Updated
Jan 5, 2023 - Java
Scanner for a custom mini language.
-
Updated
Jan 3, 2024 - Java
This is a repository for homework on programming methods
algorithms tarjan graphs priority-queue dfs dijkstra rbtree bfs kruskal rabin-karp floyd-warshall prim-algorithm kosaraju boyer-moore knuth-morris-pratt finite-automata fleury hashmap-java eulerian-cycle
-
Updated
May 3, 2022 - Java
Implementações de projetos relacionados à teoria da computação e compiladores
java computer-science compiler turing-machine regular-expressions compiladores automata-theory automatos finite-automata expressoes-regulares
-
Updated
Jun 16, 2024 - Java
Native Java implementation of a an deterministic finite automaton.
-
Updated
Nov 26, 2017 - Java
Implementation Of finite State Machines In JAVA
finite-state-machine non-deterministic-finite-automaton deterministic-finite-automata dfa-to-regex finite-automata
-
Updated
Jul 13, 2018 - Java
- Followers
- 25 followers
- Wikipedia
- Wikipedia