|
|
 |
| Результат поиска |
Поиск книг, содержащих: Grammar, context-free
| Книга | Страницы для поиска | | Briscoe E.J. — Modelling Human Speech Comprehension | 74, 84, 85, 105, 116, 145, 146, 214 | | Terry P.D. — Compliers and Compiler Generators: An Introduction With C++ | 109, 135 | | Salomaa A., Soittola M. — Automata-Theoretic Aspects of Formal Power Series | 6 | | Ito M. — Algebraic Theory of Automata and Languages | 2, 84 | | Allouche J.-P., Shallit J. — Automatic Sequences: Theory, Applications, Generalizations | 143 | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 268—270, 285. | | Kowalski R. — Logic for problem solving | 57, 94 | | Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structures | 363 | | Hein J.L. — Discrete Structures, Logic, and Computability | 640 | | Hein J.L. — Theory of Computation: An Introduction | 324 | | Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity | see "Context-free grammar" | | Salomaa A. — Computation and automata | 18 | | Allen J. — Natural language understanding | 41 | | Lieberherr K. — Adaptive object-oriented software. The Demetr method | 511 | | Rubinoff M., Yovits M. — Advances in Computers, Volume 14 | 79—80, 82, 93—97, 108—109, 119—120, 132, 140 | | Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures | 376 | | Shen A. — Algorithms and Programming | 176 | | Jones N.D. — Computability and complexity from a programming perspective | 160, 433 | | Rozenberg G., Salomaa A. — The mathematical theory of L systems | 4 | | Nievergelt J., Farrar J.C., Reingold E.M. — Computer approaches to mathematical problems | 38 |
|
|
|
|
О проекте