| Поиск по каталогу |
|
(строгое соответствие)
|
- Профессиональная
- Научно-популярная
- Художественная
- Публицистика
- Детская
- Искусство
- Хобби, семья, дом
- Спорт
- Путеводители
- Блокноты, тетради, открытки
Theory of Computation.
В наличии
| Местонахождение: Алматы | Состояние экземпляра: новый |
Бумажная
версия
версия
Автор: Vishwajit Barbuddhe,Shraddha N. Zanjat and Bhavana S. Karmore
ISBN: 9786202513586
Год издания: 2020
Формат книги: 60×90/16 (145×215 мм)
Количество страниц: 128
Издательство: LAP LAMBERT Academic Publishing
Цена: 32883 тг
Положить в корзину
Позиции в рубрикаторе
Отрасли знаний:Код товара: 568918
| Способы доставки в город Алматы * комплектация (срок до отгрузки) не более 2 рабочих дней |
| Самовывоз из города Алматы (пункты самовывоза партнёра CDEK) |
| Курьерская доставка CDEK из города Москва |
| Доставка Почтой России из города Москва |
Аннотация: The book contains: Introduction to Automata: The Methods Introduction to Finite Automata, Structural Representations, Automata and Complexity. Proving Equivalences about Sets, The Contrapositive, Proof by Contradiction, Inductive Proofs: General Concepts of Automata Theory: Alphabets Strings, Languages, Applications of Automata Theory. Finite Automata: The Ground Rules, The Protocol, Deterministic Finite Automata: Definition of a Deterministic Finite Automata, How a DFA Processes Strings, Simpler Notations for DFA’s, Extending the Transition Function to Strings, The Language of a DFA Nondeterministic Finite Automata: An Informal View. The Extended Transition Function, The Languages of an NFA, Equivalence of Deterministic and Non-deterministic Finite Automata. Finite Automata With Epsilon-Transitions: Uses of ?-Transitions, The Formal Notation for an ?-NFA, Epsilon-Closures, Extended Transitions and Languages for ?-NFA’s, Eliminating ?-Transitions.
Ключевые слова: Theory of Computation, IT
Похожие издания
 | Отрасли знаний: Общественные науки -> Этнография K Priya Theory Of Computation.. 1905 г., 136 стр., мягкий переплет This book covers fundamentals concepts of Finite Automate .Theory of Computation’ or ‘Theory of Automate is the core area of computer science and engineering; it is the branch that aims to attempts the deep understanding of computational processes by means of effectively solving the problems via mathematical models, tools, and techniques... | 36556 тг |
 | Отрасли знаний: Точные науки -> Информатика и программирование Jannatul Ferdus Taposi Theory of Computation. Basic, Easy, Relevant. 2018 г., 52 стр., мягкий переплет The teacher helps the student to acquire knowledge. The author of this manual considers that the process of acquiring knowledge should be easy. A book is viewed as a medium to learn. If we get a book which is difficult to understand then only we digest the lessons, not learn them. So, it is essential to make a topic comprehensible for easy... | 25828 тг |
 | Отрасли знаний: Точные науки -> Информатика и программирование J. Nithyashri Theory of computation. . 2017 г., 292 стр., мягкий переплет This book clearly explains the mathematical foundations of computer science. This book is written in simple English, so that the readers can learn the subject easily. The concepts are explained clearly with suitable examples. The illustrations for Automata,PDA,Turing Machines and recursive functions are structured to understand easily. The theorem... | 48389 тг |