Skip to content

Latest commit

 

History

History
41 lines (28 loc) · 2.57 KB

README.md

File metadata and controls

41 lines (28 loc) · 2.57 KB

VIDEO

https://youtu.be/QRKZcl3YaNA

Automatas-AFD-AFN-AFPD-AFPN-TT

This repository contains the implementation of various types of automata, including AFD (Deterministic Finite Automaton), AFN (Nondeterministic Finite Automaton), AFPD (Pushdown Automaton with Deterministic Control), AFPN (Pushdown Automaton with Nondeterministic Control), and TT (Turing Machine).

Overview

Automata theory is a fundamental concept in computer science and mathematics, studying abstract machines that can perform computations. This repository aims to provide implementations of different types of automata to demonstrate their behavior and functionality.

AFD (Deterministic Finite Automaton)

AFD is a finite state machine where for each state and input symbol, there is exactly one next state. It recognizes regular languages and is commonly used in lexical analysis and pattern matching.

AFN (Nondeterministic Finite Automaton)

AFN is a finite state machine where for each state and input symbol, there can be multiple next states or no next state at all. It recognizes the same set of languages as AFD but allows for greater flexibility in design.

AFN-λ (Nondeterministic Finite Automaton with lambda transitions)

AFN-lambda (Nondeterministic Finite Automaton with lambda transitions) is a finite automaton that allows multiple next states or epsilon transitions (lambda) for each state and input symbol, recognizing regular languages.

AFPD (Pushdown Automaton with Deterministic Control)

AFPD is an extension of AFD, where the machine has a stack that can be used for additional storage and computation. The control is deterministic, meaning for each state and input symbol, there is exactly one next state. AFPD recognizes context-free languages.

AFPN (Pushdown Automaton with Nondeterministic Control)

AFPN is similar to AFPD, but the control is nondeterministic, allowing for multiple next states or no next state at all for each state and input symbol. AFPN also recognizes context-free languages.

TT (Turing Machine)

TT is a more powerful computational model than the previous automata types. It consists of an infinite tape divided into cells and a read-write head that can move left or right. TT can perform arbitrary computations and recognize recursively enumerable languages.

#Team Members

Dylan Rivero Esteves

Miller Estiven Barrera Gonzalez

Cesar Arthuro Lemos Silva

Juan David Tique Triana

Cristian Camilo García Palacios

Installation

To install the necessary packages, run the following command in your terminal:

pip install graphviz

Feel free to contribute and use this proyect c: