## Algorithms, Languages, Automata, and Compilers: A Practical ApproachAlgorithms, Languages, Automata, & Compilers A Practical Approach is designed to cover the standard “theory of computing” topics through a strong emphasis on practical applications rather than theorems and proofs. Finite automata, Turing machines, models of computation, complexity, solvability, and other topics that form a foundation of modern programming are discussed -first with a gentle theoretical orientation, and then applied through programming code and practical examples. JFLAP projects and applications are integrated throughout the book, and C# is used for all code. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

PREFACE | |

CHAPTER 1Regular Languages and Regular Expressions | |

CHAPTER 2Finite Automata | |

CHAPTER 3The Relationship Between Finite Automata and Regular Expressions | |

CHAPTER 4FiniteState Machines in Practice | |

CHAPTER 5Nonregular Languages and ContextFree Grammars | |

CHAPTER 6Pushdown Automata | |

CHAPTER 7Parsing | |

### Other editions - View all

Algorithms, Languages, Automata, & Compilers: A Practical Approach: A ... Maxim Mozgovoy No preview available - 2009 |

### Common terms and phrases

accepted algorithm alphabet analyze automata behavior bool cell chapter char character Chomsky normal form Church–Turing thesis Coco/R compiler complex consists construction contains context-free grammar context-free language Convert corresponding create CurrentGameState defined definition described determine deterministic finite automaton device discuss element email addresses empty string emulator example execution favorable finite-state machine ﬁrst formal grammar formal languages GOTO tables grammar rules halting problem implementation initial input data input string input tape integer numbers intermediate code JFLAP L-systems label List<string means menu minimization nonregular languages nonterminal symbol obtain operation pair parse tree parser polynomial possible practice programming language pseudocode pushdown automaton recognizes regular expression regular languages result RValue scanner sequence shown in Figure simple situation solution solve stack static void step substring syntax terminal symbol TinyCode Turing machine turtle variable whitespace