Obálkyknih.cz - Jihočeská vědecká knihovna v Českých Budějovicích

oprava existující anotace, přidání nové anotace

Název:		Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Autor:
Rok vydání:		1994
Identifikátory:		9780817637194

Upravte stávající anotaci nebo vložte anotaci novou.
Anotace:	The material in this book is situated at the juncture of the automata theory, logic, computational complexity and semigroup theory. The first part of the book is devoted to the algebraic characterization of the regular languages definable in many different logical theories. This includes older results of Büchi on monadic second-order language, and of McNaughton and Papert on first-order logic and star-free languages, as well as many more recent developments that have never been treated in book form. The second part presents the recently-discovered connections between the algebraic theory of the automata and the complexity theory of small-depth circuits. This self-contained work is suitable for use as a text for a course. Exercises appear at the end of each chapter, some to test knowledge, others to extend the investigation. Citations at the end of each chapter provide a useful guide to related topics mentioned in the text of the chapter. The book will be welcomed by both advanced students and researchers in theoretical computer science, algebra, and mathematical logic.
	Souhlasím s využitím anotace pro potřeby projektu obálkyknih.cz. Obsah neporušuje autorská práva.(povinné)