185 100 5MB
English Pages 548 Year 2004
Report DMCA / Copyright
DOWNLOAD DJVU FILE
Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The autho
103 13 5MB Read more
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
Pierre Berloquin, who put together this stimulating and delightful collection of mind benders, is a clever young Frenchm
112 66 5MB Read more
Several of the contributions to this volume bring forward many mutually beneficial interactions and connections between
265 15 5MB Read more
99 11 7MB Read more
Computation, itself a form of calculation, incorporates steps that include arithmetical and non-arithmetical (logical) s
210 16 9MB Read more
The study of the connections between mathematical automata and formal logic is as old as theoretical computer science it
435 10 11MB 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
368 93 2MB Read more
235 12 7MB Read more