Program to construct a DFA which accept the language L = {a^nb^m | n mod 2=0, m≥1}
-
Updated
Oct 17, 2019 - C
Program to construct a DFA which accept the language L = {a^nb^m | n mod 2=0, m≥1}
[컴파일러] 파이썬으로 구현한 Lexical Analyzer
Add a description, image, and links to the construct topic page so that developers can more easily learn about it.
To associate your repository with the construct topic, visit your repo's landing page and select "manage topics."