An introduction to automata theory
著者
書誌事項
An introduction to automata theory
（Computer science texts / consulting editors K.J. Bowcock, Dr. A.M. Gibbons, M.C. Henson）
Blackwell Scientific, 1987
- : pbk
大学図書館所蔵 件 / 全21件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes index
内容説明・目次
内容説明
This book is an introduction to the elementary structure theory of finite state machines. After preliminary definitions, the book discusses what it means for one machine to implement another, using the notation of a realization, and in particular, the notion of machine reduction. Reference is made to the fact that machines form a category, with realizations as morphisms. Next, the serial and parallel composition of machines are looked at and it is shown that these operations satisfy certain algebraic relations up to isomorphism. The Hartmanis-Yoeli parallel and serial decomposition theorems, which depend on congruence relations of the state space of a machine are then presented. Subsequent chapters investigate the computation of the set of all such congruences, making use of the fact that they form a lattice. Finally, the lattice of congruences are used to analyze machine decomposition.
目次
- Great Aunt Eugenia and other automata
- Sundry machines
- Implementing finite automata
- Implementation and realization
- Behavioural equivalence, SP partitions and reduced machines
- Parallel and serial composition of automata
- The parallel decomposition theorem
- The serial decomposition theorem
- The lattice of SP partitions
- Analysis of machines
- Concurrent systems: net theory
- Concurrent systems: the calculus of communicating systems. Appendix: Sets, relations and functions.
「Nielsen BookData」 より