An Introduction to computable languages and abstract machines
著者
書誌事項
An Introduction to computable languages and abstract machines
International Thomson Computer Press, 1996
大学図書館所蔵 件 / 全4件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes index
内容説明・目次
内容説明
An introduction to formal language theory and automata theory, this text aims to enable the reader to appreciate the widespread applications of these subjects to computing in general. It contains worked examples and problems, and is aimed at all students studying these subjects.
目次
- From languages to computation
- Elements of formal languages
- Syntax, semantics and ambiguity
- Regular languages and finite state recognizers
- Context free grammars and pushdown recognizers
- Important features of regular and context free languages
- Phrase structure languages and Turing machines
- From computation to languages
- Finite state transducers
- Turing machines as computers
- Dimensions of computation
- The limits of computation and the scope of phrase structure languages
- Postscript.
「Nielsen BookData」 より