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.
Keywords for this software
References in zbMATH (referenced in 8 articles )
Showing results 1 to 8 of 8.
- Jirásková, Galina; Palmovský, Matúš; Šebej, Juraj: Kleene closure on regular and prefix-free languages (2014)
- Linz, Peter: An introduction to formal languages and automata. With CD-ROM (2012)
- Ahn, Jae-Hee; Han, Yo-Sub: Implementation of state elimination using heuristics (2009)
- Alecha, Mikel; Hermo, Montserrat: A learning algorithm for deterministic finite automata using JFLAP (2009) ioport
- Armoni, Michal; Ben-Ari, Mordechai: The concept of nondeterminism: Its development and implications for teaching (2009) MathEduc
- Rutishauser, Ueli; Douglas, Rodney J.: State-dependent computation using coupled recurrent networks (2009)
- Tsay, Yih-Kuen; Chen, Yu-Fang; Tsai, Ming-Hsien; Wu, Kang-Nien; Chan, Wen-Chin; Luo, Chi-Jian; Chang, Jinn-Shu: Tool support for learning Büchi automata and linear temporal logic (2009)
- Wagenknecht, Christian; Hielscher, Michael: Formal languages, abstract automata and compiler. Text- and Workbook for undergrade courses and advanced training (2009)