Finite automata. (2003)

• Record Type: Book
• Further Information: Note: Mark V. Lawson.
• Other Names: Lawson, Mark V
• Contents: INTRODUCTION TO FINITE AUTOMATA ; Alphabets and Strings; Languages; Language Operations; Finite Automata: Motivation; Finite Automata and their Languages; Summary of Chapter 1; Remarks on Chapter 1; RECOGNISABLE LANGUAGES ; Designing Automata; Incomplete Automata; Automata which Count; Automate which Locate Patterns; Boolean Operations; The Pumping Lemma; Summary of Chapter 2; Remarks on Chapter 2; NON-DETERMINISTIC AUTOMATA ; Accessible Automata; Non-Deterministic Automata; Applications; Trim Automata; Grammars; Summary of Chapter 3; Remarks on Chapter 3; e -AUTOMATA ; Automata withe-Transitions; Applications of e-Automata; Summary of Chapter 4; Remarks on Chapter 4; KLEENE'S THEOREM ; Regular Languages; Kleene's Theorem: Proof; Kleene's Theorem: algorithms; Language Equations; Summary of Chapter 5 ; Remarks on Chapter 5; LOCAL LANGUAGES ; Myhill Graphs; Linearisation; Summary of Chapter 6; Remarks on Chapter 6; MINIMAL AUTOMATA ; Partitions and Equivalence Relations; The Indistinguishability Relation; Isomorphisms of Automata; The Minimal Auomaton; The Method of Quotients; Summary of Chapter 7; Remarks on Chapter 7; THE TRANSITION MONOID ; Functions on States; The Extended Transition Table; The Cayley Table of an Automaton; Semigroups and Monoids; Summary of Chapter 8; Remarks on Chapter 8; THE SYNTACTIC MONOID ; Introduction to Semigroups; Congruences; The Transition Monoid of an Automaton; The Syntactic Monoid of a Language; Summary of Chapter 9; Remarks on Chapter 9; ALGEBRAIC LANGUAGE THEORY ; Finite Semigroups; Recognisability by a Monoid; Two Counterexamples; Summary of Chapter 10; Remarks on Chapter 10 ; STAR-FREE LANGUAGES ; Introduction; Groups; Aperiodic Semigroups; Schutzenberger's Theorem; An Example; Summary of Chapter 11; Remarks on Chapter 11; VARIETIES OF LANGUAGES ; Pseudovarieties and Varieties; Summary of Chapter 12; Remarks on Chapter 12; APPENDIX: DISCRETE MATHEMATICS ; Logic and Proofs; Set Theory; Numbers and Matrices; Graphs; Functions; Relations; BIBLIOGRAPHY ; INDEX
• Publisher Details: Place of publication not identified : Chapman and Hall/CRC
• Publication Date: 2003
• Extent: 1 online resource (320 pages), (176 illustrations)
• Subjects: 511.3; Sequential machine theory; Sequential machine theory -- Problems, exercises, etc; Semigroups; Semigroups -- Problems, exercises, etc; Semigroups; Sequential machine theory; Problems and exercises
• Languages: English
• ISBNs: 9781482285840; 1482285843
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.