|
|
Sold Out
Book Categories |
| Preface | ||
| 1 | Introduction to finite automata | 1 |
| 2 | Recognisable languages | 27 |
| 3 | Non-deterministic automata | 53 |
| 4 | [epsilon]-automata | 85 |
| 5 | Kleene's Theorem | 97 |
| 6 | Local languages | 127 |
| 7 | Minimal automata | 141 |
| 8 | The transition monoid | 171 |
| 9 | The syntactic monoid | 191 |
| 10 | Algebraic language theory | 217 |
| 11 | Star-free languages | 235 |
| 12 | Varieties of languages | 265 |
| A | Discrete mathematics | 279 |
| Bibliography | 293 | |
| Index | 303 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Finite Automata
X
This Item is in Your Inventory
Finite Automata
X
You must be logged in to review the productsX
X
X
Add Finite Automata, Accessible even to readers with only a basic knowledge of discrete mathematics, this treatment develops the underlying algebra gently but rigorously, and nearly 200 exercises reinforce the concepts. Whether your primary interest lies in computer science o, Finite Automata to the inventory that you are selling on WonderClubX
X
Add Finite Automata, Accessible even to readers with only a basic knowledge of discrete mathematics, this treatment develops the underlying algebra gently but rigorously, and nearly 200 exercises reinforce the concepts. Whether your primary interest lies in computer science o, Finite Automata to your collection on WonderClub |