✈️ Turing Airlines Machine ✈️

Developed by 💻:

• Fernando Schettini.
• Heverton Silva dos Reis.

About 🤔:

The GitHub project introduces two Turing Machines, MT1 and MT2, designed to calculate the arrival time at a destination based on flight duration, departure time, departure meridian, and arrival meridian (in degrees, with east and west indicators) all these parameters are represented in unary base. More details at the report.

Resourses 🧑‍🔬:

• MT1 O(n^2): classic single-tape Turing Machine it processes input data on a single tape to determine the arrival time at the destination.

• MT2 O(n): a new machine that introduces a two-tape Turing Machine with enhanced parallel processing capabilities. With dual tapes and transitions from the final state, MT2 show a simple example of how it can provide flexibility with more tapes.

How to run it 🏃:

First, clone this repository. After that, execute JFLAP with:

java -jar JFLAP7.1.jar 

After that, open MT1.jff or MT2.jff. Remember to alter the preferences when opening MT2.jff like in image 1.

Figure 1 - TM1 image.

TM's 🎬:

Figure 2 - TM1 image.

Figure 3 - TM2 image.

Logic Model 🧮:

Here's the logic model that represents how the turing machines work.

Figure 4 - Turing machines logic model.

Tools Used 🛠️:

• JFLAP, for designing the TM's.
• Overleaf, for writing the report.

Licence 📜:

Apache V2

References 📙:

[1] SIPSER, Michael. Michael. Introduction to the Theory of Computation. 2nd Edi- tion. Boston: Thomson Course Technology, 2006.

[2] VIEIRA, Newton José. Languages and Machines: An Introduction to the Funda- mentals of Computing. 1st Edition. Belo Horizonte: Department of Computer Science, Institute of Exact Sciences, Federal University of Minas Gerais, 2004.

[3] GEEKS FOR GEEKS. Turing Machine as Comparator. Geeks for Geeks, 2023. Available at: https://www.geeksforgeeks.org/turing-machine-as-comparator/ Accessed on: November 20, 2023.