Randomized algorithms
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Hi-index | 5.23 |
Computability and complexity are the two major lines along which the science of algorithms has evolved; but the same concepts guide many human activities. We try to catch some glimpses of the connections between these two worlds, to meet the expectations of the audience. We will encounter nymphs and universal Turing Machines, ancient traditions and randomized procedures, all tending to the same end: having fun with algorithms.