by Keijo Ruohonen
Publisher: Tampere University of Technology 2009
Number of pages: 98
In these lecture notes the classical Chomskian formal language theory is fairly fully dealt with, omitting however much of automata constructs and computability issues. In addition, surveys of Lindenmayer system theory and the mathematical theory of codes are given.
Home page url
Download or read it online for free here:
by Harold Abelson, Gerald Jay Sussman, Julie Sussman - McGraw-Hill
The book teaches how to program by employing the tools of abstraction and modularity. The central philosophy is that programming is the task of breaking large problems into small ones. You will learn how to program and how to think about programming.
by Dennie Van Tassel - Gavilan College
This website contains files on the history of computer programming language statements. The files compare programming language statements in several different languages tracing the statement from early languages to present languages.
by Hanne Riis Nielson, Flemming Nielson - John Wiley & Sons
The book covers the foundations of structural operational semantics and natural semantics. It shows how to describe the semantics of declarative as well as imperative language constructs and will also touch upon non-sequential constructs.
by Jean Gallier, Andrew Hicks - University of Pennsylvania
From the table of contents: Automata; Formal Languages (A Grammar for Parsing English, Context-Free Grammars, Derivations and Context-Free Languages, Normal Forms for Context-Free Grammars, Chomsky Normal Form, ...); Computability; Current Topics.