scientific article; zbMATH DE number 3999299
Ackermann functionautomata theorycomputabilityfinite automatainfinite automatalogical networksrecursive functionsregular setsstate reductionTuring machinesundecidable problemsuniversal automata
Turing machines and related notions (03D10) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)
This book is one in the Series in Computer Science (in China). In the book, the author provides a nice introduction to several important areas of automata theory and computability with emphasis on the basic concepts, results, and methods of finite automata and infinite automata (Turing machines). The first part (from chapter 1 to chapter 8) of the book is devoted to the theory of finite automata. The author provides an elegant and concise introduction to the theory of logical networks, state reduction, regular sets, linear finite automata, autonomous finite automata, state identification experiment, memorization and invertibility. The second part (from chapter 9 to chapter 13) on infinite automata introduces universal automata, Turing machines, recursive functions on words, undecidable problems and computation with bounded time and space resource. The author provides a very concise introduction into some fundamental but quite nontrival construction methods of recursive function theory and computability. In particular, the last chapter gives the author's results on the computational complexity of the well-known Ackermann's function. The book is nicely written. The author covers a broad range of material, and thus provides a good introduction to the field. The proofs are well presented, each chapter contains a set of exercises. Therefore, this book can serve as a textbook for a variety of undergraduate or graduate courses on the theory of automata.
- Reliability analysis of a cold standby system with imperfect repair and under Poisson shocks
- Bayesian variable sampling plan for the Weibull distribution with type I censoring.
- The reliability of solar energy generating system with inverters in series under common cause failure
- scientific article; zbMATH DE number 3170711 (Why is no real title available?)
- scientific article; zbMATH DE number 3856413 (Why is no real title available?)
- Finite automata
- scientific article; zbMATH DE number 3976344 (Why is no real title available?)
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- scientific article; zbMATH DE number 45686 (Why is no real title available?)
- Aspects of Computation and Automata Theory with Applications
- Well-posedness and stability of the repairable system with \(N\) failure modes and one standby unit
- Reliability equivalence factors in gamma distribution
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4725753)