|
|
 |
| Результат поиска |
Поиск книг, содержащих: Deterministic finite automaton
| Книга | Страницы для поиска | | Aho A.V., Sethi R., Ullman J.D. — Compilers: principles, techniques and tools | 113, 115—121, 127—328, 132—136, 141—146, 150, 180—181, 217, 222, 224—226 | | Allouche J.-P., Shallit J. — Automatic Sequences: Theory, Applications, Generalizations | 128 | | Hopcroft J.E., Motwani R., Ullman J.D. — Introduction to Automata Theory, Languages, and Computation | 45—55, 60—64, 67, 70—72, 79, 91—101, 150—151 | | Gonnet G.H., Baeza-Yates R. — Handbook of algorithms and data structures | see DFA | | Hein J.L. — Discrete Structures, Logic, and Computability | 585 | | Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing | 116, 255 (see also “Finite automaton”) | | Hein J.L. — Theory of Computation: An Introduction | 268 | | Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation | 57 | | Smyth B. — Computing patterns in strings | see "DFA" | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 285 | | Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | 19 (see also Finite automaton) | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 285 | | Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling. Volume II: Compiling | 116, 255, see also "Finite automaton" | | Partee B.H., Meulen A.T., Wall R.E. — Mathematical Methods in Linguistics | 457—463, 477 | | Gossett E. — Discrete Math with Proof | 557 | | Jones N.D. — Computability and complexity from a programming perspective | 437 |
|
|
|
|
О проекте