JFLAP is software for experimenting with formal languages topics including nondeterministic finite automata, nondeterministic pushdown automata, multi-tape Turing machines, several types of grammars, parsing, and L-systems. In addition to constructing and testing examples for these, JFLAP allows one to experiment with construction proofs from one form to another, such as converting an NFA to a DFA to a minimal state DFA to a regular expression or regular grammar. Click here for more information on what one can do with JFLAP.
JFLAP是实验与形式语言，主题包括非确定性有限自动机，非确定下推自动机，多带图灵机，多种类型的文法，语法分析，而L-系统软件。除了构建和测试这些例子，JFLAP允许一个实验证明，与建筑形式从一个到另一个，例如将一NFA到一个DFA到最小状态DFA的正则表达式或正规文法。
链接http://www.jflap.org/
JFLAP是实验与形式语言，主题包括非确定性有限自动机，非确定下推自动机，多带图灵机，多种类型的文法，语法分析，而L-系统软件。除了构建和测试这些例子，JFLAP允许一个实验证明，与建筑形式从一个到另一个，例如将一NFA到一个DFA到最小状态DFA的正则表达式或正规文法。
链接http://www.jflap.org/
没有评论:
发表评论