Simple turing machine made in python The sample automata accepts strings from: L = {a^n . b^(2n) : n >= 1}
Example: abb (accepts) aabbbb (accepts) aab (don't accept)
Henrique Jesus Henistein
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import numpy as np | |
| import matplotlib.pyplot as plt | |
| class HeniNet: | |
| def __init__(self, layers, lr=0.001, epochs=1000): | |
| self.X = None | |
| self.Y = None | |
| self.layers = layers | |
| self.lr = lr | |
| self.epochs = epochs |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #! /usr/bin/python3 | |
| import sys | |
| inf = sys.stdin.buffer | |
| data = [] | |
| byte = '' | |
| # Read data from file in blocks of 16 bytes | |
| # Python >= 3.8 |