Automata and languages

John M. Howie

Theoretical models of simple computing mahcines, known as automata, play a central role in theoretical computer science. This textbook presents an introduction to the theory of automata and to their connections with the study of languages. At the heart of the book is the notion that by considering a language as a set of words it is possible to construct automata which 'recognize' words in the language. Consequently one can generate a correspondence between a hierarchy of machines and a corresponding hierarchy of grammars and languages. Professor Howie leads the reader from finite state automata through pushdown automata to Turing machines. He demonstrates clearly and elegantly the fundamental connections between automata and abstract algebra via the notions of syntactic monoid and minimal automaton. The author presupposes a basic familiarity with modern algebra, but beyond this the book is self-contained. As a result, the book will make ideal reading for students of mathematics and computer science approaching this subject for the first time.

「Nielsen BookData」より

[目次]

  • Mathematical preliminaries
  • Automata
  • The Syntactic monoid
  • Languages
  • Pushdown automata
  • Turing machines
  • Varieties
  • Index.

「Nielsen BookData」より

この本の情報

書名 Automata and languages
著作者等 Howie, John Mackintosh
出版元 Clarendon Press;Oxford University Press
刊行年月 1991
ページ数 x, 294 p.
大きさ 25 cm
ISBN 0198534426
0198534248
NCID BA13555817
※クリックでCiNii Booksを表示
言語 英語
出版国 イギリス
この本を: 
このエントリーをはてなブックマークに追加

このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想