Описание: Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, G?del’s incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.
Автор: Adrian-Horia Dediu; Jan Janou?ek; Carlos Mart?n-Vi Название: Language and Automata Theory and Applications ISBN: 3319299999 ISBN-13(EAN): 9783319299990 Издательство: Springer Рейтинг: Цена: 10342.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 10th InternationalConference on Language and Automata Theory and Applications, LATA 2016, held inPrague, Czech Republic, in March 2016. The 42 revised full papers presented together with 5 invited talks werecarefully reviewed and selected from 119 submissions.
Автор: J?rgen Dassow; Gheorghe Paun Название: Regulated Rewriting in Formal Language Theory ISBN: 3642749348 ISBN-13(EAN): 9783642749346 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: To our families The formal language theory was born in the middle of our century as a tool for modelling and investigating the syntax of natural languages, and it has been developed mainly in connection with programming language handling.
Автор: Carlos Martin-Vide; Friedrich Otto; Henning Fernau Название: Language and Automata Theory and Applications ISBN: 3540882812 ISBN-13(EAN): 9783540882817 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the Second International Conference on Language and Automata Theory and Applications, LATA 2008, held in Tarragona, Spain, in March 2008. This book presents 40 revised papers that are reviewed and selected from 134 submissions and deal with the various issues related to automata theory and formal languages.
Автор: Adrian Horia Dediu; Armand Mihai Ionescu; Carlos M Название: Language and Automata Theory and Applications ISBN: 3642009816 ISBN-13(EAN): 9783642009815 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the Third International Conference on Language and Automata Theory and Applications, LATA 2009, held in Tarragona, Spain, in April 2009. This work contains papers that address the various issues related to automata theory and formal languages.
Автор: Brlek Название: Developments in Language Theory ISBN: 3662531313 ISBN-13(EAN): 9783662531310 Издательство: Springer Рейтинг: Цена: 9224.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 20th International Conference on Developments in Language Theory, DLT 2016, held in Montreal, QC, Canada, in July 2016. The 32 full papers and 4 abstracts of invited papers presented were carefully reviewed and selected from 48 submissions.
Автор: Frank Drewes; Carlos Mart?n-Vide; Bianca Truthe Название: Language and Automata Theory and Applications ISBN: 3319537326 ISBN-13(EAN): 9783319537320 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 11th International Conference on Language and Automata Theory and Applications, LATA 2017, held in Umea, Sweden, in March 2017. The 31 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 73 submissions.
Автор: Adrian-Horia Dediu; Carlos Mart?n-Vide; Jos?-Luis Название: Language and Automata Theory and Applications ISBN: 3319049208 ISBN-13(EAN): 9783319049205 Издательство: Springer Рейтинг: Цена: 14673.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 8th International Conference on Language and Automata Theory and Applications, LATA 2014, held in Madrid, Spain in March 2014.The 45 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 116 submissions. trees, tree languages and tree automata;
Автор: Shaoying Liu; Zhenhua Duan Название: Structured Object-Oriented Formal Language and Method ISBN: 3319049143 ISBN-13(EAN): 9783319049144 Издательство: Springer Рейтинг: Цена: 8803.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes revised selected papers from the Third International Workshop on Structured Object-Oriented Formal Language and Method, SOFL+MSVL 2013, held in Queenstown, New Zealand, in October 2013.
Автор: Shaoying Liu; Zhenhua Duan Название: Structured Object-Oriented Formal Language and Method ISBN: 3319174037 ISBN-13(EAN): 9783319174037 Издательство: Springer Рейтинг: Цена: 5590.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-workshop proceedings of the 4th International Workshop on Structured Object-Oriented Formal Language and Method, SOFL+MSVL 2014, held in Luxembourg, Luxembourg, in November 2014. The 12 papers presented in this volume were carefully reviewed and selected from 20 submissions.
Автор: Igor Potapov Название: Developments in Language Theory ISBN: 3319214993 ISBN-13(EAN): 9783319214993 Издательство: Springer Рейтинг: Цена: 8944.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Recognisable Languages over Monads.- Garside and quadratic normalisation: a survey.- Grammar-Based Tree Compression.- On decidability of intermediate levels of concatenation hierarchies.- Ergodic in Finite permutations of minimal complexity.- Diverse Palindromic Factorization is NP-Complete.- Factorization in Formal Languages.- Consensus Game Acceptors.- On the Size of Two-Way Reasonable Automata for the Liveness Problem.- Squareable Words.- Complexity Analysis: Transformation Monoids of Finite Automata.- Palindromic complexity of trees.- Deciding proper conjugacy of classes of one-sided Finite-type-Dyck shifts.- Transfinite Lyndon words.- Unary patterns under permutations.- Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change.- Enumeration formulin neutral sets.- On the Density of Context-Free and Counter Languages.- Star-Continuous Kleene Omega-Algebras.- Unary probabilistic and quantum automata on promise problems.- Generalizations of Code Languages with Marginal Errors.- Minimal Reversible Deterministic Finite Automata.- Multi-Sequential Word Relations.- The Boundary of Prefix-Free Languages.- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group.- Path Checking for MTL and TPTL over Data Words.- On Distinguishing NC1 and NL.- Sur minimisation of automata.- On the Complexity of k-Piecewise Testability and the Depth of Automata.- Interval Exchange Words and the Question of Hof, Knill, and Simon.- State Complexity of Neighbourhoods and Approximate Pattern Matching.- Deterministic ordered restarting automata that compute functions.- Weight Assignment Logic.- Complexity Bounds of Constant-Space Quantum Computation.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
