Applied Automata Theory
eBook - PDF

Applied Automata Theory

  1. 342 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Applied Automata Theory

About this book

Applied Automata Theory provides an engineering style of presentation of some of the applied work in the field of automata theory. Topics covered range from algebraic foundations and recursive functions to regular expressions, threshold logic, and switching circuits. Coding problems and stochastic processes are also discussed, along with content addressable memories, probabilistic reliability, and Turing machines. Much emphasis is placed on engineering applications. Comprised of nine chapters, this book first deals with the algebraic foundations of automata theory, focusing on concepts such as semigroups, groups and homomorphisms, and partially ordered sets and lattices, as well as congruences and other relations. The reader is then introduced to regular expressions; stochastic automata and discrete systems theory; and switching networks as models of discrete stochastic processes. Subsequent chapters explore applications of automata theory in coding; content addressable and distributed logic memories; recursive functions and switching-circuit theory; and synthesis of a cellular computer. The book concludes with an assessment of the fundamentals of threshold logic. This monograph is intended for graduates or advanced undergraduates taking a course in information science or a course on discrete systems in modern engineering curriculum.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Applied Automata Theory by Julius T. Tou in PDF and/or ePUB format, as well as other popular books in Technology & Engineering & Physics. We have over one million books available in our catalogue for you to explore.

Information

Table of contents

  1. Front Cover
  2. Applied Automata Theory
  3. Copyright Page
  4. Table of Contents
  5. LIST OF CONTRIBUTORS
  6. PREFACE
  7. Chapter 1. Algebraic Foundations for Automata Theory
  8. Chapter 2. An Introduction t o Regular Expressions
  9. Chapter 3. Stochastic Automata and Discrete Systems Theory
  10. Chapter 4. Switching Networks as Models of Discrete Stochastic Processes
  11. Chapter 5. Applications of Automata Theory in Coding
  12. Chapter 6. Content Addressable and Distributed Logic Memories
  13. Chapter 7. Recursive Functions and Switching-Circuit Theory
  14. Chapter 8. Synthesis of a Cellular Computer
  15. Chapter 9. Fundamentals of Threshold Logic
  16. AUTHOR INDEX
  17. SUBJECT INDEX