Formal Language and Automaton Concepts

This project explores the concepts of formal languages and automata and includes practical implementations of them in various programming languages.

Included Projects:

Regex to Delta-NFA Conversion
- A C++ program for converting a regular expression into a non-deterministic finite automaton (NFA) using the δ-NFA technique.
Finite State Automaton
- A Python implementation of a deterministic finite automaton (DFA) and operations for manipulating it.
Grammar Checking
- A simple implementation in Python of an algorithm to check if a word belongs to a given grammar.

Name		Name	Last commit message	Last commit date
Latest commit History 10 Commits
conversion-regex-to-delta-nfa @ 324e740		conversion-regex-to-delta-nfa @ 324e740
finite-state-automaton @ 9683b66		finite-state-automaton @ 9683b66
verificare-cuvant-pentru-o-framatica-LFA @ 4b84545		verificare-cuvant-pentru-o-framatica-LFA @ 4b84545
.gitmodules		.gitmodules
README.md		README.md