|
|
 |
| Результат поиска |
Поиск книг, содержащих: Recursively enumerable language
| Книга | Страницы для поиска | | Sipser M. — Introduction to the theory of computation | 142 | | Papadimitriou C.H. — Computational Complexity | 24, 59, 61, 63 | | Hopcroft J.E., Motwani R., Ullman J.D. — Introduction to Automata Theory, Languages, and Computation | 326, 368, 379, 384 | | Hein J.L. — Discrete Structures, Logic, and Computability | 749 | | Hein J.L. — Theory of Computation: An Introduction | 437 | | Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation | 198 | | Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | 150, 168—169, 180—192, 210, 228, 230, 270 | | Partee B.H., Meulen A.T., Wall R.E. — Mathematical Methods in Linguistics | 507, 558, 563 | | Sipser M. — Introduction to the Theory of Computation | 130 | | Gill A. — Applied Algebra for the Computer Sciences | 233 | | Badii R., Politi A. — Complexity: Hierarchical structures and scaling in physics | 180 |
|
|
|
|
О проекте