|
|
 |
| Результат поиска |
Поиск книг, содержащих: Language, context-free
| Книга | Страницы для поиска | | Salomaa A., Soittola M. — Automata-Theoretic Aspects of Formal Power Series | 6 | | Ito M. — Algebraic Theory of Automata and Languages | 2, 83, 84 | | Allouche J.-P., Shallit J. — Automatic Sequences: Theory, Applications, Generalizations | 143, 144 | | Sipser M. — Introduction to the theory of computation | 101 | | Tanimoto S.L. — The elements of artificial intelligence. An introduction using LISP | 331 | | Hein J.L. — Discrete Structures, Logic, and Computability | 640—642, 685—694 | | Scott M.L. — Programming Language Pragmatics | 33, 87, 94 | | Hein J.L. — Theory of Computation: An Introduction | 324—325, 369—378 | | Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity | see "Context-free language" | | Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation | 114—175 | | Stanley R.P. — Enumerative Combinatorics: Volume 2 | 204 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 137, 233, 235 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 137,233,235 | | Salomaa A. — Computation and automata | 18 | | Sipser M. — Introduction to the Theory of Computation | 93 | | Gill A. — Applied Algebra for the Computer Sciences | 237 | | Shen A. — Algorithms and Programming | 176 | | Rozenberg G., Salomaa A. — The mathematical theory of L systems | 4 |
|
|
|
|
О проекте