Dòng Nội dung
1
Algebraic theory of automata and languages / Masami Itō
River Edge, N.J. : World Scientific, 2004
x, 199 pages. : illustrations ; 24 cm.
Ký hiệu phân loại (DDC): 511.35
Although there are some books dealing with algebraic theory ofautomata, their contents consist mainly of Krohn-Rhodes theory andrelated topics. The topics in the present book are ratherdifferent. For example, automorphism groups of automata and thepartially ordered sets of automata are systematicallydiscussed. Moreover, some operations on languages and special classesof regular languages associated with deterministic andnondeterministic directable automata are dealt with. The book isself-contained and hence does not require any knowledge of automataand formal languages
Số bản sách: (10) Tài liệu số: (0)
2
Algorithmic information theory / Gregory J Chaitin
Cambridge [Cambridgeshire] ; New York : Cambridge University Press, 1987
x, 175 pages. ; 25 cm.
Ký hiệu phân loại (DDC): 006.31
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Goedel's incompleteness theorem, using an information theoretic approach based on the size of computer programs.
Số bản sách: (1) Tài liệu số: (0)
3
An introduction to formal languages and automata / Peter Linz
Sudbury, Mass. : Jones and Bartlett Publishers,1996
xix, 377 pages. : illustrations ; 24 cm.
Ký hiệu phân loại (DDC): 005.131
Formal languages, automata, computability, and related matters form the major part of the theory of computation. This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language, the fundamentals of
Số bản sách: (1) Tài liệu số: (0)
4
Automata and computability / Dexter C. Kozen
New York : Springer, 1997
407 p. ; cm.
Ký hiệu phân loại (DDC): 004.0151
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course. Plenty of exercises are provided, ranging from the easy to the challenging
Số bản sách: (0) Tài liệu số: (1)
5
Automata, computability and complexity : theory and applications / Elaine Rich
Upper Saddle River, N.J. : Pearson Prentice Hall, 2008.
xix, 1099 pages. : illustrations ; 24 cm.
Ký hiệu phân loại (DDC): 511.3
Số bản sách: (2) Tài liệu số: (0)