|
|
 |
| Результат поиска |
Поиск книг, содержащих: Regular grammar
| Книга | Страницы для поиска | | Ito K. — Encyclopedic Dictionary of Mathematics. Vol. 2 | 31.D | | Jurafsky D., Martin J.H. — Speech and Language Processing | 476 | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 269. | | Ito K. — Encyclopedic Dictionary of Mathematics | 31.D | | Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structures | 363, 371 | | Hein J.L. — Discrete Structures, Logic, and Computability | 626—630 | | Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing | 122, 499 | | Pal S.K., Pal A. (eds.) — Pattern Recognition: From Classical to Modern Approaches | 192 | | Hein J.L. — Theory of Computation: An Introduction | 310—318 | | Marques de Sa J.P. — Pattern recognition: concepts, methods, and applications | 256 | | Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity | 97 | | Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | 217—220 | | Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling. Volume II: Compiling | 122, 499 | | Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics | 414 | | Allen J. — Natural language understanding | 47 | | Gossett E. — Discrete Math with Proof | 542, 571 | | Brady J.M. — The theory of computer science: A programming approach | 91 | | Gill A. — Applied Algebra for the Computer Sciences | 237 | | Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures | 376, 385 | | Jones N.D. — Computability and complexity from a programming perspective | see "Grammar" |
|
|
|
|
О проекте