Над 4 милиона заглавия на английски и други езици! Открийте новата си история още днес! Безплатна доставка за поръчки над 69.99€

Проверка на състоянието на поръчката

Станете част от общност от любители на книгите от цял свят и получавате много предимства. Създай на безплатен акаунт

Безплатна доставка със Еконт над 69.99 €

Куриер Speedy 3.49 € Пункт на Speedy 3.49 € ЕКОНТ 3.99 € Еконтомат/Офис на Еконт 3.99 € Ekont Box 3.99 € Sameday 3.99 € Sameday box 3.99 € Box Now 3.99 €

Контакт

Как се пазарува?

Помощ

Моят акаунт

▸ Празна :-(

Finite Automata, Formal Logic, and Circuit Complexity

Name: Finite Automata, Formal Logic, and Circuit Complexity
Brand: Springer, Berlin
SKU: 06794874
Price: 119.25 EUR
Availability: InStock
Author: Howard Straubing
ISBN: 9781461266952

Howard Straubing

Език

Английски език

Книга С меки корици

Код Либристо: 06794874

Издателство Springer, Berlin, март 2013

The study of the connections between mathematical automata and for mal logic is as old as theoretica... Цялото описание

Код Либристо: 06794874

289 b

119.25 €

233.23 лв

Външен склад Изпращаме след 5-8 дни

До 30 дни за връщане на стоки

Клиентите са закупили също

Manifeste de l'émergence africaine - un projet politique et un défi économique encore à définir Dessinga

С меки корици

21.22 € 41.51 лв

Un cours de physique théorique Ivan L'Heureux

С меки корици

58.30 € 114.03 лв

Manuel d'entretien des machines ? coudre pour les instituts de formation professionnelle Lengamo Lenteta

С меки корици

41.42 € 81.00 лв

C++ für Programmierer Falko Bause

С меки корици

44.82 € 87.67 лв

ELLA SAUVAGEOT L'AUDACE UNE FEMME DE PRESSE SAUVAGEOT Книга

С меки корици

33.15 € 64.84 лв

De Tom y Jerry a las supernenas MAURICIO SCHWARZ

С меки корици

25.87 € 50.60 лв

Die Eiskönigin - Olaf taut auf + Die Eiskönigin - Party Fieber, 1 DVD Jesse Averna

DVD

9.39 € 18.37 лв

The study of the connections between mathematical automata and for mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960's with the work of J. Richard Biichi on monadic second-order logic. Biichi's investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert's book, the underlying semigroup theory has grown enor mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com puter science community, which moved to other concerns.