Models of computation based on automata: formal languages and communicating processes

Résumé fourni par la source

First-year students in computer science and related fields usually follow a course on Automata Theory and Formal Languages. This course gives students the foundations of computer science, and tells them what a computer can and cannot do. The course is based on the computer model called the Turing Machine, that adequately describes a computer as they were in the seventies, a stand-alone machine executing batch processes. However, the Turing machine is blind, deaf and dumb, very different from computers as we know them today. I would not let a Turing machine drive my car. This book integrates automata theory with process theory, and treats alongside the classical results about languages their generalisations about communicating processes, and some new results. In just 200 pages with plenty of exercises, it can serve as a replacement of the classical course for first-year students.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.