372 18 11MB
English Pages 237 Year 1994
Report DMCA / Copyright
DOWNLOAD DJVU FILE
Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P
105 6 5MB Read more
363 92 2MB Read more
Доклад. Technical Report Series: DCC-2011- 11. Departamento de Ciencia de Computadores.Finite automata public-key crypto
395 11 152KB Read more
Imelda Choquette (Translator)
442 98 91MB Read more
99 11 7MB Read more
The main objective of this work is to represent the behaviors of weighted automata by expressively equivalent formalisms
122 92 2MB Read more
Carroll J., Long D. Theory of finite automata (PH, 1989)(ISBN 0139137084)(KA)(447s)
456 81 2MB Read more
103 19 6MB Read more
Formal languages and automata theory is the study of abstract machines and how these can be used for solving problems. T
254 48 5MB Read more
The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. But the cla
385 54 202MB Read more