通讯技术>> formal-languages-and-automata>> 返回
项目作者： ralucatudor

项目描述 ：
NFA Membership; Conversion of Lambda-NFA to Minimal DFA (using Myhill-Nerode Theorem); Conversion of Regular Grammar to NFA
高级语言： C++
项目地址: git://github.com/ralucatudor/formal-languages-and-automata.git


formal-languages-and-automata

GitHub top language

Project no. 1

  • NFA (Nondeterministic Finite Automaton) - and implicitly DFA (Deterministic Finite Automaton) - Membership;
  • Generating the shortest 100 words accepted by an automaton.

Project no. 2

Conversion of Lambda-NFA to Minimal DFA

Project no. 3

Regular Grammar -> Lambda-Free Regular Grammar -> Equivalent Finite State Automaton (NFA) -> DFA