Metadata-Version: 2.1
Name: turing_machine_utils
Version: 1.0.7
Summary: Calculate the result of a turing machine on a given tape
Home-page: https://github.com/porfanid/TuringMachine
Author: porfanid
Author-email: pavlos@orfanidis.net.gr
License: MIT
Project-URL: Funding, https://ko-fi.com/porfanid
Project-URL: Source, https://github.com/porfanid/TuringMachine
Project-URL: Documentation, https://github.com/porfanid/TuringMachine
Project-URL: Tracker, https://github.com/porfanid/TuringMachine/issues
Project-URL: Say Thanks!, https://saythanks.io/to/porfanid
Description: 
        ## Table of Contents
        
        - [Introduction](#introduction)
        - [Features](#features)
        - [Installation](#installation)
        - [Usage](#usage)
        - [Configuration](#configuration)
        - [Contributing](#contributing)
        - [License](#license)
        
        ## Introduction
        
        Run any Turing machine possible using this function and see if the turing machine, accepts or rejects the tape you input to it.
        
        ## Installation
        
        ```bash
        pip install turing-machine-utils
        ```
        
        ## Usage
        
        ```python
        from turing_machine_utils import create_turing_machine
        
        # Define Turing Machine states, alphabet, and transition rules
        states = ['q0', 'q1', 'accept', 'discard']
        transition_rules = {
            ('q0', '0'): ('q1', '1', 'R'),
            ('q0', '1'): ('q0', '0', 'R'),
            ('q1', '0'): ('accept', '0', 'L'),
            ('q1', '1'): ('discard', '1', 'L'),
        }
        
        # Define the input tape
        tape = ['0', '1', '0', '1', '0']
        
        # Run the Turing Machine
        result, new_tape, state, symbol = create_turing_machine(tape, states, transition_rules)
        print("Result:", result)
        ```
        > remember that the machine will start calculating the response from the first state. So the first element on the states list must be the beginning state
        
        The result will be:
        1. 1 if the tape is accepted by the turing machine
        1. -1 if the state is discarded by the turing machine
        1. 0 if an undefined transition is found by the turing machine
        
        The new_tape is the tape with the changes to the original tape
        
        The state and symbol are normally None. They get values that say when the turing machine reached an undefined point
        
        ## Configuration
        
        No specific configuration options are available at the moment.
        
        ## Contributing
        
        Feel free to contribute by reporting issues, suggesting improvements, or submitting pull requests.
        
        ## License
        
        This project is licensed under the MIT License - see the [LICENSE](./LICENSE.md) file for details.
Keywords: Turing Machine,Turing Machine Simulator,Python,Automata,Simulation,Computational Theory,State Machine,Algorithm,Artificial Intelligence,Machine Learning,Computational Science,Programming,Open Source,Education,Computer Science,Formal Languages,Computational Models,Tape,States,Transition Rules,Simulation Tool,Complexity,Symbol,Universal Turing Machine,Computer Engineering,Software Development
Platform: UNKNOWN
Requires-Python: >=3.6
Description-Content-Type: text/markdown
