Vyhledávat v databázi titulů je možné dle ISBN, ISSN, EAN, č. ČNB, OCLC či vlastního identifikátoru. Vyhledávat lze i v databázi autorů dle id autority či jména.
Projekt ObalkyKnih.cz sdružuje různé zdroje informací o knížkách do jedné, snadno použitelné webové služby. Naše databáze v tuto chvíli obsahuje 3151204 obálek a 950590 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Rok: 1994
ISBN: 9780817637194
OKCZID: 110042240
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.