- Peter Linz - Introduction to Formal Languages and Automata 5th
edition, Includes CD of JFLAP exercises bundled in. ISBN-978-1-4496-1552-9.

Rodger and Linz have worked closely the past few years resulting in this book being a good fit with JFLAP's definitions and algorithms.

- CD
JFLAP Activities for Formal Languages and Automata, ISBN-13: 9780763772024,
Supplement with JFLAP exercises by Linz and Rodger published
Dec. 2008.
This CD has JFLAP examples and exercises chapter by chapter to fit
with the Linz book mentioned below. (this is now bundled in with
Linz 5th edition mentioned above).

- Susan Rodger and Thomas Finley,
JFLAP - An Interactive Formal Languages and
Automata Package, ISBN 0763738344, Jones and Bartlett, 2006.

This book is a supplemental book to use with most automata theory books and shows how to use JFLAP with finite automata, pushdown automata, Turing machines, grammars (regular, context-free and unrestricted), LL and SLR parsing, and L-systems. It includes usage of JFLAP with several proof conversions such as NFA to DFA to minimal state DFA, DFA to regular expression, CFG to pushdown automata, etc.

- Peter Linz - Introduction to Formal Languages and Automata 4th
edition, ISBN-13:978-0-7637-3798-6.

Rodger and Linz have worked closely the past few years resulting in this book being a good fit with JFLAP's definitions and algorithms.

- Mozgovoy, Maxim, Algorithms, Languages, Automata, and Compilers. Jones
and Bartlett. 2010.

This book uses JFLAP in several places with finite automata, pushdown automata, Turing machines, L-systems, and some of the conversion proofs. The book includes screen shots from JFLAP.

- Gopalakrishnan, G. L. Computation Engineering: Applied Automata Theory and Logic. Springer Science+Business Media LLC, 2006.

This book encourages the use of JFLAP for working with nondeterministic finite automata, deterministic finite automata, and Turing Machines. JFLAP is suggested for educational exercises.

- Ben-Ari, Mordechai. Principles of the Spin Model Checker. Springer-Verlag London Limited 2008.

JFLAP is referenced in the book and the Visualizing Nondeterminism (VN) software tool mentioned reads nondeterministic finite automata from the JFLAP file format. - Goddard, Wayne. Introducing the Theory of Computation. Jones and Bartlett Publishers, Inc 2008.

An interlude section between the first two parts introduces JFLAP, gives a brief explanation of its capabilities, and recommends its use for working with various models. - Rosa, Joao Luis G., "Linguagens Formais e Automatos" (Formal Languages
and Automata), in Portuguese).
Editora LTC, Rio de Janeiro, Brazil, 2010.
ISBN: 9788521617518.

This book uses JFLAP in many examples and exercises with finite automata, pushdown automata, and Turing machines. The book includes screen shots of JFLAP. - Hattenhauer, Rainer, "Informatik fur Schule und Ausbildung" (Computer
Science for School and Education), Pearson Education Munich 2010, ISBN
978-3868949018

The book uses JFLAP in a dedicated chapter (12) to teach students the most popular elements of automaton theory. It includes screenshots from JFLAP and several practical examples. - Automatas, Gramaticas y Lenguajes Formales: problemas resueltos (automata, grammars and formal languages: problems solved in Spanish). Tomas GarcA-a y Elena Gaudioso. Sanz y Torres. 2011 ISBN 9788492948369. This book recommends JFLAP for us in exercises.

If you know of a book that uses or mentions JFLAP, please send us a note at jflap "at" cs.duke.edu with the relevant information