Logic, Automata, and Algorithms ( Volume 79 )

Publication series :Volume 79

Author: Aiserman   Mark A.;Gusev   Leonid A.;Rozonoer   Lev I.  

Publisher: Elsevier Science‎

Publication year: 1971

E-ISBN: 9780080955872

P-ISBN(Paperback): 9780120463503

P-ISBN(Hardback):  9780120463503

Subject: TP31 computer software

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;
methods for low-rank matrix approximations; hybrid methods based on a combination of iterative procedures and best operator approximation; and
methods for information compression and filtering under condition that a filter model should satisfy restrictions associated with causality and different types of memory.

As a result, the book represents a blend of new methods in general computational analysis,
and specific, but also generic, techniques for study of systems theory ant its particular
branches, such as optimal filtering and information compression.

- Best operator approximation,
- Non-Lagrange interpolation,
- Generic Karhunen-Loeve transform
- Generalised low-rank matrix approximation
- Optimal data compression
- Optimal nonlinear filtering

Chapter

Front Cover

pp.:  1 – 4

Copyright Page

pp.:  5 – 6

Contents

pp.:  6 – 10

Preface

pp.:  10 – 11

Translator's Note

pp.:  11 – 12

Introduction

pp.:  12 – 14

Chapter 2. Engineering Applications of Propositional Calculus

pp.:  40 – 71

Chapter 3. Finite Automata and Sequential Machines: Basic Concepts

pp.:  71 – 99

Chapter 4. Abstract Structure and Nets

pp.:  99 – 129

Chapter 5. Technical Embodiment of Finite Automata and Sequential Machines

pp.:  129 – 157

Chapter 6. Autonomous Finite Automata and Sequential Machines

pp.:  157 – 172

Chapter 7. Representation of Events in Finite Automata and Sequential Machines

pp.:  172 – 200

Chapter 8. Recognition of Realizability of a Given Specification. Abstract Synthesis of Finite Automata and Sequential Machines

pp.:  200 – 232

Chapter 9. Equivalence and Minimization of Sequential Machines

pp.:  232 – 273

Chapter 10. Transformation of Clock Rates of Sequential Machines

pp.:  273 – 297

Chapter 11. Determination of the Properties of Sequential Machines from Their Response to Finite Input Sequences

pp.:  297 – 317

Chapter 12. Algorithms

pp.:  317 – 368

Chapter 13. Turing Machines

pp.:  368 – 390

Conclusion

pp.:  390 – 399

Problems

pp.:  399 – 422

Bibliography

pp.:  422 – 440

Addenda to Bibliography

pp.:  440 – 443

Index

pp.:  443 – 450

The users who browse this book also browse


No browse record.