**Formal Languages**

by Keijo Ruohonen

**Publisher**: Tampere University of Technology 2009**Number of pages**: 98

**Description**:

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.

Download or read it online for free here:

**Download link**

(1MB, PDF)

## Similar books

**Partial Evaluation and Automatic Program Generation**

by

**Neil D. Jones, Carsten K. Gomard, Peter Sestoft**-

**Prentice Hall**

The book about partial evaluation, a program optimization technique also known as program specialization. It presents principles for constructing partial evaluators for a variety of programming languages, and gives references to the literature.

(

**12377**views)

**Semantics of Programming Languages**

by

**Andrew M. Pitts**-

**University of Cambridge**

These notes introduce the structural, operational approach to programming language semantics. The course shows how to specify the meaning of some simple programming language constructs and to reason formally about semantic properties of programs.

(

**4797**views)

**Computational Category Theory**

by

**D.E. Rydeheard, R.M. Burstall**

The book is a bridge-building exercise between computer programming and category theory. Basic constructions of category theory are expressed as computer programs. It is a first attempt at connecting the abstract mathematics with concrete programs.

(

**14528**views)

**The Design and Implementation of Probabilistic Programming Languages**

by

**Noah D. Goodman, Andreas Stuhlmüller**-

**dippl.org**

This book explains how to implement PPLs by lightweight embedding into a host language. We illustrate this by designing WebPPL, a small PPL embedded in Javascript. We show how to implement several algorithms for universal probabilistic inference.

(

**2459**views)