JFLAP: An Interactive Formal Languages and Automata Package is a hands-on supplemental guide through formal languages and automata theory. JFLAP guides students interactively through many of the concepts in an automata theory course or the early topics in a compiler course, including the descriptions of algorithms JFLAP has implemented. Students can experiment with the concepts in the text and receive immediate feedback when applying these concepts with the accompanying software. The text describes each area of JFLAP and reinforces concepts with end-of-chapter exercises. In addition to JFLAP, this guide incorporates two other automata theory tools into JFLAP: JellRap and Pate.
FREE Two-Day Shipping for Students. Learn more |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
1 of 1 people found the following review helpful:
4.0 out of 5 stars
Great addition to JFLAP's usefullness,
This review is from: JFLAP: An Interactive Formal Languages and Automata Package (Paperback)
The JFLAP program is pretty intuitive, but in the few instances when it isn't, this book has you covered. It includes algorithms and definitions so even when you don't have JFLAP around, it's a good resource. The included exercises are great for figuring out how to apply JFLAP to particular problems and understanding the concepts of each section.
Overall, some people may find the book unnecessary, but it doesn't hurt to get the information in another way.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
In this section you will learn how to build automata in JF'LAP by way of constructing, with help, the DFA that recognizes the language of strings of any number of a's followed by any odd number of 6's (e.g., ab, bbb, aabbbbb). Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
derivation table, pushdown automaton, automaton editor, jff file, parse table, stepping simulation, unrestricted grammar, grammar editor, useless productions, start variable, fast simulator, single final state, turtle state, click oil, accepting configuration, sentential form, empty transitions, parsing method, hue angle, original grammar, tape symbol, stack symbol, derivation steps, parse tree Key Phrases - Capitalized Phrases (CAPs): (learn more)
Select Input, Attribute Editor, File Input Convert Help, Noninverted Tree, Select Convert, State Creator, Complete Selected, Transition Creator, Click Step, Fast Run, Transform Grammar, Brute Force Parse, Input Remaining, File Input Test Convert Help Simulate, Compare Equivalence, Keep Looking, Create Selected, The Turing, Render the L-system, Multiple Run, Run Inputs, Show All, Convert Selected, Enter Lambda, Dismiss Tab Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
In this section you will learn how to build automata in JF'LAP by way of constructing, with help, the DFA that recognizes the language of strings of any number of a's followed by any odd number of 6's (e.g., ab, bbb, aabbbbb). Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
derivation table, pushdown automaton, automaton editor, jff file, parse table, stepping simulation, unrestricted grammar, grammar editor, useless productions, start variable, fast simulator, single final state, turtle state, click oil, accepting configuration, sentential form, empty transitions, parsing method, hue angle, original grammar, tape symbol, stack symbol, derivation steps, parse tree Key Phrases - Capitalized Phrases (CAPs): (learn more)
Select Input, Attribute Editor, File Input Convert Help, Noninverted Tree, Select Convert, State Creator, Complete Selected, Transition Creator, Click Step, Fast Run, Transform Grammar, Brute Force Parse, Input Remaining, File Input Test Convert Help Simulate, Compare Equivalence, Keep Looking, Create Selected, The Turing, Render the L-system, Multiple Run, Run Inputs, Show All, Convert Selected, Enter Lambda, Dismiss Tab Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
What Other Items Do Customers Buy After Viewing This Item?
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
