Advertisement

Theory of Digital Automata

  • Bohdan Borowik
  • Mykola Karpinskyy
  • Valery Lahno
  • Oleksandr Petrov

Table of contents

  1. Front Matter
    Pages i-xii
  2. Bohdan Borowik, Mykola Karpinskyy, Valery Lahno, Oleksandr Petrov
    Pages 1-7
  3. Bohdan Borowik, Mykola Karpinskyy, Valery Lahno, Oleksandr Petrov
    Pages 9-18
  4. Bohdan Borowik, Mykola Karpinskyy, Valery Lahno, Oleksandr Petrov
    Pages 19-35
  5. Bohdan Borowik, Mykola Karpinskyy, Valery Lahno, Oleksandr Petrov
    Pages 37-43
  6. Bohdan Borowik, Mykola Karpinskyy, Valery Lahno, Oleksandr Petrov
    Pages 45-49
  7. Bohdan Borowik, Mykola Karpinskyy, Valery Lahno, Oleksandr Petrov
    Pages 51-73
  8. Bohdan Borowik, Mykola Karpinskyy, Valery Lahno, Oleksandr Petrov
    Pages 75-100
  9. Bohdan Borowik, Mykola Karpinskyy, Valery Lahno, Oleksandr Petrov
    Pages 101-141
  10. Bohdan Borowik, Mykola Karpinskyy, Valery Lahno, Oleksandr Petrov
    Pages 143-171
  11. Back Matter
    Pages 173-206

About this book

Introduction

This book serves a dual purpose: firstly to combine the treatment of circuits and digital electronics, and secondly, to establish a strong connection with the contemporary world of digital systems. The need for this approach arises from the observation that introducing digital electronics through a course in traditional circuit analysis is fast becoming obsolete. Our world has gone digital. Automata theory helps with the design of digital circuits such as parts of computers, telephone systems and control systems.

A complete perspective is emphasized, because even the most elegant computer architecture will not function without adequate supporting circuits. The focus is on explaining the real-world implementation of complete digital systems. In doing so, the reader is prepared to immediately begin design and implementation work. This work serves as a bridge to take readers from the theoretical world to the everyday design world where solutions must be complete to be successful.

Keywords

C# Digital Automata PLD Programmable Logic Transition Functions

Authors and affiliations

  • Bohdan Borowik
    • 1
  • Mykola Karpinskyy
    • 2
  • Valery Lahno
    • 3
  • Oleksandr Petrov
    • 4
  1. 1., Department of Electrical Engineering andUniversity of Bielsko-BialaBielsko-BialaPoland
  2. 2., Computer Science DivisionUniversity of Bielsko-BialaBielsko-BialaPoland
  3. 3., Department of Computer Systems and NetwoEast-Ukrainian National UniversityLuhanskUkraine
  4. 4., Department of Applied Computer ScienceAGH University of Science and TechnologyKrakowPoland

Bibliographic information

  • DOI https://doi.org/10.1007/978-94-007-5228-3
  • Copyright Information Springer Science+Business Media Dordrecht 2013
  • Publisher Name Springer, Dordrecht
  • eBook Packages Engineering
  • Print ISBN 978-94-007-5227-6
  • Online ISBN 978-94-007-5228-3
  • Series Print ISSN 2213-8986
  • Series Online ISSN 2213-8994
  • Buy this book on publisher's site
Industry Sectors
Pharma
Automotive
Biotechnology
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Aerospace
Engineering