tag:github.com,2008:https://github.com/arhcoder/Pytomatas/releasesRelease notes from Pytomatas2023-06-05T02:36:20Ztag:github.com,2008:Repository/649220305/v.1.1.42023-06-05T02:38:37ZPytomatas v.1.1.4<h1>🤖 Pytomatas</h1>
<p><strong>📌 Version 1.1.4</strong></p>
<hr>
<p>Pytomatas allows to simulate Acceptor Automata in the console with Python, implementing its characteristics using different definitions (mathematics included), with the following types:</p>
<ul>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/dfa.md" title="DFA">DFA</a> (Deterministic Finite Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/nfa.md" title="NFA">NFA</a> (Non-deterministic Finite Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/pda.md" title="PDA">PDA</a> (Push-Down Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/tm.md" title="TM">TM</a> (Turing Machine)</strong>;</li>
</ul>
<p>What can do?</p>
<ul>
<li>Create and manage various types of automaton: DFA, NFA, PDA, TM.</li>
<li>Visualize automata information in console.</li>
<li>Simulate automata acceptors based on strings.</li>
<li>Observe the processes of steps and transitions when introducing a string to the automaton.</li>
</ul>
<hr>
<p><strong>✅ All implementation and installing erroros fixed (for now) :3</strong></p>
<hr>arhcodertag:github.com,2008:Repository/649220305/v.1.1.32023-06-05T02:28:02ZPytomatas v.1.1.3<h1>🤖 Pytomatas</h1>
<p><strong>📌 Version 1.1.3</strong></p>
<hr>
<p>Pytomatas allows to simulate Acceptor Automata in the console with Python, implementing its characteristics using different definitions (mathematics included), with the following types:</p>
<ul>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/dfa.md" title="DFA">DFA</a> (Deterministic Finite Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/nfa.md" title="NFA">NFA</a> (Non-deterministic Finite Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/pda.md" title="PDA">PDA</a> (Push-Down Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/tm.md" title="TM">TM</a> (Turing Machine)</strong>;</li>
</ul>
<p>What can do?</p>
<ul>
<li>Create and manage various types of automaton: DFA, NFA, PDA, TM.</li>
<li>Visualize automata information in console.</li>
<li>Simulate automata acceptors based on strings.</li>
<li>Observe the processes of steps and transitions when introducing a string to the automaton.</li>
</ul>
<hr>
<p><strong>â• NOT FIXED ERROR:</strong> It installed correctly with <em>"pip install"</em>, but the modules was not found becasue error on setup.py file. It has a new link to install the library correctly in the documentation.</p>
<hr>arhcodertag:github.com,2008:Repository/649220305/v.1.1.22023-06-05T02:18:52ZPytomatas v.1.1.2<h1>🤖 Pytomatas</h1>
<p><strong>📌 Version 1.1.2</strong></p>
<hr>
<p>Pytomatas allows to simulate Acceptor Automata in the console with Python, implementing its characteristics using different definitions (mathematics included), with the following types:</p>
<ul>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/dfa.md" title="DFA">DFA</a> (Deterministic Finite Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/nfa.md" title="NFA">NFA</a> (Non-deterministic Finite Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/pda.md" title="PDA">PDA</a> (Push-Down Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/tm.md" title="TM">TM</a> (Turing Machine)</strong>;</li>
</ul>
<p>What can do?</p>
<ul>
<li>Create and manage various types of automaton: DFA, NFA, PDA, TM.</li>
<li>Visualize automata information in console.</li>
<li>Simulate automata acceptors based on strings.</li>
<li>Observe the processes of steps and transitions when introducing a string to the automaton.</li>
</ul>
<hr>
<p><strong>â• NOT FIXED ERROR:</strong> It installed correctly with <em>"pip install"</em>, but the modules was not found becasue error on setup.py file. It has a new link to install the library correctly in the documentation.</p>
<hr>arhcodertag:github.com,2008:Repository/649220305/v.1.1.12023-06-04T23:18:07ZPytomatas v.1.1.1<h1>🤖 Pytomatas</h1>
<p><strong>📌 Version 1.1.1</strong></p>
<hr>
<p>Pytomatas allows to simulate Acceptor Automata in the console with Python, implementing its characteristics using different definitions (mathematics included), with the following types:</p>
<ul>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/dfa.md" title="DFA">DFA</a> (Deterministic Finite Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/nfa.md" title="NFA">NFA</a> (Non-deterministic Finite Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/pda.md" title="PDA">PDA</a> (Push-Down Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/tm.md" title="TM">TM</a> (Turing Machine)</strong>;</li>
</ul>
<p>What can do?</p>
<ul>
<li>Create and manage various types of automaton: DFA, NFA, PDA, TM.</li>
<li>Visualize automata information in console.</li>
<li>Simulate automata acceptors based on strings.</li>
<li>Observe the processes of steps and transitions when introducing a string to the automaton.</li>
</ul>
<hr>arhcodertag:github.com,2008:Repository/649220305/v.1.1.02023-06-04T23:08:24Zv.1.1.0<p>Simulates Automatons Acceptors DFA, NFA, PDA and Turing Machines</p>arhcodertag:github.com,2008:Repository/649220305/v.1.0.02023-06-04T22:36:54ZPytomatas v.1.0.0<h1>🤖 Pytomatas</h1>
<p><strong>📌 Version 1.0.0</strong></p>
<hr>
<p>Pytomatas allows to simulate Acceptor Automata in the console with Python, implementing its characteristics using different definitions (mathematics included), with the following types:</p>
<ul>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/dfa.md" title="DFA">DFA</a> (Deterministic Finite Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/nfa.md" title="NFA">NFA</a> (Non-deterministic Finite Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/pda.md" title="PDA">PDA</a> (Push-Down Automaton)</strong>;</li>
<li><strong><a href="https://github.com/arhcoder/Pytomatas/blob/master/docs/tm.md" title="TM">TM</a> (Turing Machine)</strong>;</li>
</ul>
<p>What can do?</p>
<ul>
<li>Create and manage various types of automaton: DFA, NFA, PDA, TM.</li>
<li>Visualize automata information in console.</li>
<li>Simulate automata acceptors based on strings.</li>
<li>Observe the processes of steps and transitions when introducing a string to the automaton.</li>
</ul>
<hr>arhcoder