The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one...
The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to repre...
This Festschrift volume has been published in honor of Cristian Calude on the occasion of his 60th birthday and contains contributions from invited speakers and regular papers presented at the International Workshop on Theoretical Computer Science, WTCS 2012, held in Auckland, New Zealand, in February 2012.
Cristian Calude has made a significant contribution to research in computer science theory. Along with early work by Chaitin, Ku era, Kurtz, Solovay, and Terwijn his papers published in the mid-1990s jointly with Khoussainov, Hertling, and Wang laid the foundation for the development...
This Festschrift volume has been published in honor of Cristian Calude on the occasion of his 60th birthday and contains contributions from invited...
Presents the fundamental topics of discrete mathematics that are introduced from the perspectives of a pure mathematician and an applied computer scientist. This book helps readers learn how to formally define abstract concepts, reason about objects, investigate properties of algorithms, and prove their correctness.
Presents the fundamental topics of discrete mathematics that are introduced from the perspectives of a pure mathematician and an applied computer scie...
