1.) An implementation of a Cellular Automaton.
2.) An implementation with A visualization of an NFA/DFA generating strings from a language.
3.) Extraction of a Context-Free Grammar Extracted from a given text source
Using any programming language
2 freelances font une offre moyenne de 30 $ pour ce travail
Hi, I could create your automaton in JFlap which provides a visualization for NFA and DFA. ping me for more details.
Hello, I am C++ developer and I am very good at language theory and automata. I know non deterministic finite automata and deterministic ones by heart. I once built my own regular expressions library which work in a si Plus