ATFL-State-Finite-Machines

ATFL-State-Finite-Machines

maciej-nowak

State finite machines examples, thrax gramma and simple regex tasks. Created at the University as the project within Automata Theory and Formal Languages classes in 2014. The purpose of those examples was to learn automata and formal languages theory and also create simple state finite machines.

2 Stars
0 Forks
2 Watchers
C++ Language
Cost to Build
$2.7K
Market Value
$971

Growth over time

5 data points  ·  2021-11-01 → 2023-02-01
Stars Forks Watchers
💬

How do you feel about this project?

Ask AI about ATFL-State-Finite-Machines

Question copied to clipboard

What is the maciej-nowak/ATFL-State-Finite-Machines GitHub project? Description: "State finite machines examples, thrax gramma and simple regex tasks. Created at the University as the project within Automata Theory and Formal Languages classes in 2014. The purpose of those examples was to learn automata and formal languages theory and also create simple state finite machines. ". Written in C++. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone ATFL-State-Finite-Machines

Clone via HTTPS

git clone https://github.com/maciej-nowak/ATFL-State-Finite-Machines.git

Clone via SSH

[email protected]:maciej-nowak/ATFL-State-Finite-Machines.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the ATFL-State-Finite-Machines issue tracker:

Open GitHub Issues