Algebraic automata theory
Author(s)
Bibliographic Information
Algebraic automata theory
(Cambridge studies in advanced mathematics, 1)
Cambridge University Press, 2004, c1982
- : pbk
Available at 14 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"First paperback edition 2004"--T.p. verso
Includes bibliographical references (p. [221]-222) and indexes
Description and Table of Contents
Description
This is a self-contained, modern treatment of the algebraic theory of machines. Dr Holcombe examines various applications of the idea of a machine in biology, biochemistry and computer science and gives also a rigorous treatment of the way in which these machines can be decomposed and simulated by simpler ones. This treatment is based on fundamental ideas from modern algebra. Motivation for many of the newer results is provided by way of applications so this account should be accessible and valuable for those studying applied algebra or theoretical computer science at advanced undergraduate or beginning postgraduate level, as well as for those undertaking research in those areas.
Table of Contents
- Introduction
- 1. Semigroups and their relatives
- 2. Machines and semigroups
- 3. Decompositions
- 4. The holonomy decomposition
- 5. Recognizers
- 6. Sequential machines and functions
- Appendix
- References
- Index of notation
- Index.
by "Nielsen BookData"