zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Automata theory with modern applications. With contributions by Tom Head. (English) Zbl 1127.68049
Cambridge: Cambridge University Press (ISBN 0-521-61324-8/pbk; 0-521-84887-3/hbk; 978-0-511-60720-2/ebook). viii, 255 p. £ 24.99; $ 45.00/pbk; £ 55.00; $ 99.00/hbk (2006).

This textbook presents in the first five chapters more or less the “standard” programme for any formal language theory course and includes topics such as finite automata, syntactic monoids, minimal automata, pumping lemmata, pushdown automata, grammars, Chomsky and Greibach normal form, equivalence of grammars and automata, Turing machines, halting problem, and undecidable properties of context-free languages. Also the presentation is as usual, with some idiosyncrasy (e.g., the definition of minimal automata, here called intrinsic automata, the definition of nondeterministic Turing machines, a paragraph relating CFGs to nondeterministic Turing machines, and some more).

What makes this textbook unique is its final two chapters, written by Tom Head. Chapter 6, “A visual approach to formal language theory”, is devoted to the area called combinatorics on words and presents material usually not found in an introductory text. Finally, the words “modern applications” in the title of the book are a tribute to the last chapter, in which on 10 pages a glimpse of applications of formal language theory in molecular biology, centered around the notion of a splicing language, is presented.

Every section of the book ends with a number of exercises. The book ends with a bibliography section (with pointers to further literature mainly for the last two chapters) as well a “further reading” section containing links to further textbooks and tutorial papers.

68Q45Formal languages and automata
68-01Textbooks (computer science)
68Q05Models of computation (Turing machines, etc.)
68Q10Modes of computation
68Q42Grammars and rewriting systems
68Q70Algebraic theory of languages and automata
68R15Combinatorics on words