Semirings, Automata, Languages (Paperback, Softcover reprint of the original 1st ed. 1986)

Automata theory is the oldest among the disciplines constituting the subject matter of this Monograph Series: theoretical computer science. Indeed, automata theory and the closely related theory of formal languages form nowadays such a highly developed and diversified body of knowledge that even an exposition of "reasonably important" results is not possible within one volume. The purpose of this book is to develop the theory of automata and formal languages, starting from ideas based on linear algebra. By what was said above, it should be obvious that we do not intend to be encyclopedic. However, this book contains the basics of regular and context-free languages (including some new results), as well as a rather complete theory of pushdown automata and variations (e. g. counter automata). The wellknown AFL theory is extended to power series ("AFP theory"). Additional new results include, for instance, a grammatical characterization of the cones and the principal cones of context-free languages, as well as new decidability results.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Monographs in Theoretical Computer Science. An EATCS Series, 5
Release date:	November 2011
First published:	1986
Authors:	W. Kuich • A. Salomaa
Dimensions:	244 x 170 x 20mm (L x W x T)
Format:	Paperback
Pages:	376
Edition:	Softcover reprint of the original 1st ed. 1986
ISBN-13:	978-3-642-69961-0
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Promotions
LSN:	3-642-69961-8
Barcode:	9783642699610

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!