|
|
 |
| Результат поиска |
Поиск книг, содержащих: Nondeterministic finite automaton
| Книга | Страницы для поиска | | Aho A.V., Sethi R., Ullman J.D. — Compilers: principles, techniques and tools | 113—114, 117—128, 130—132, 136 | | Allouche J.-P., Shallit J. — Automatic Sequences: Theory, Applications, Generalizations | 130 | | Sipser M. — Introduction to the theory of computation | 47—58 | | Hopcroft J.E., Motwani R., Ullman J.D. — Introduction to Automata Theory, Languages, and Computation | 55—70, 96, 150—151, 163 (see also “$\epsilon$-NFA”) | | Hein J.L. — Discrete Structures, Logic, and Computability | 588 | | Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing | 117 (see also “Finite automaton”) | | Hein J.L. — Theory of Computation: An Introduction | 271 | | Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation | 65 | | Smyth B. — Computing patterns in strings | see "NDFA" | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 282 | | Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | 19—33 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 282 | | Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling. Volume II: Compiling | 117, see also "Finite automaton" | | Gossett E. — Discrete Math with Proof | 557 | | Sipser M. — Introduction to the Theory of Computation | 47—58, 278 | | Shen A. — Algorithms and Programming | 148 |
|
|
|
|
О проекте