Finite Automata: Behavior and Synthesis

✍ Scribed by B. A. Trakhtenbrot, Ya. M. Barzdin'

Publisher: Elsevier
Year: 1973
Tongue: Russian
Leaves: 326
Series: Fundamental Studies in Computer Science 1
Category: Library

⬇ Acquire This Volume

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite Automata

📁 Finite Automata

✍ Mark V. Lawson 📂 Library 📅 2003 🏛 Chapman and Hall/CRC 🌐 English

Interest in finite automata theory continues to grow, not only because of its applications in computer science, but also because of more recent applications in mathematics, particularly group theory and symbolic dynamics. The subject itself lies on the boundaries of mathematics and computer science,

Switching and Finite Automata Theory

📁 Switching and Finite Automata Theory

✍ Zvi Kohavi, Niraj K. Jha 📂 Library 📅 2009 🏛 Cambridge University Press 🌐 English

This is the most important book in computer science,because the author has written all of the mathematical materials in it.If you read it,it will help you to understand what "Algorithm" is.:)

Switching and Finite Automata Theory

📁 Switching and Finite Automata Theory

✍ Zvi Kohavi, Niraj K. Jha 📂 Library 📅 2010 🏛 Cambridge University Press 🌐 English

Behavioural Models: From Modelling Finit

📁 Behavioural Models: From Modelling Finite Automata to Analysing Business Processes

✍ Matthias Kunze, Mathias Weske (auth.) 📂 Library 📅 2016 🏛 Springer International Publishing 🌐 English

<p>This textbook introduces the basis for modelling and analysing discrete dynamic systems, such as computer programmes, soft- and hardware systems, and business processes. The underlying concepts are introduced and concrete modelling techniques are described, such as finite automata, state machines

Finite Automata and Application to Crypt

📁 Finite Automata and Application to Cryptography

✍ Renji Tao 📂 Library 📅 2009 🏛 Springer 🌐 English

Finite Automata and Application to Crypt

📁 Finite Automata and Application to Cryptography

✍ Renji Tao 📂 Library 📅 2009 🏛 Springer 🌐 English

Finite Automata and Application to Cryptography mainly deals with the invertibility theory of finite automata and its application to cryptography. In addition, autonomous finite automata and Latin arrays, which are relative to the canonical form for one-key cryptosystems based on finite automata, ar