Автор: Michel Rigo Название: Formal Languages, Automata and Numeration Systems ISBN: 1848216157 ISBN-13(EAN): 9781848216150 Издательство: Wiley Рейтинг: Цена: 22010.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory).
Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns. When considering some numeration systems, any integer can be represented as a finite word over an alphabet of digits. This simple observation leads to the study of the relationship between the arithmetical properties of the integers and the syntactical properties of the corresponding representations. One of the most profound results in this direction is given by the celebrated theorem by Cobham. Surprisingly, a recent extension of this result to complex numbers led to the famous Four Exponentials Conjecture. This is just one example of the fruitful relationship between formal language theory (including the theory of automata) and number theory.
Автор: Marco T. Moraz?n Название: Programming-Based Formal Languages and Automata Theory ISBN: 3031439724 ISBN-13(EAN): 9783031439728 Издательство: Springer Рейтинг: Цена: 8384.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs. The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design. In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets. Part II starts the study of formal languages and automata theory in earnest with regular languages. It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language. Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language. This leads to the study of deterministic and nondeterministic finite-state machines. Part III starts the exploration of languages that are not regular with context-free languages. It begins with context-free grammars and pushdown automata to generate and recognize context-free languages, and it ends with a discussion of deterministic pushdown automata and illustrates why these automatons are fundamentally different from nondeterministic pushdown automata. Part IV eventually explores languages that are not context-free, known as context-sensitive languages. It starts by discussing the most powerful automaton known to mankind: the Turing machine. It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored. The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical.
Описание: Consists of papers selected from the presentations at the workshop and includes mainly recent developments in the fields of formal languages, automata theory and algebraic systems related to the theoretical computer science and informatics. This book covers the areas such as automata and grammars, languages and codes, and logics and trees.
Автор: W. Kuich; A. Salomaa Название: Semirings, Automata, Languages ISBN: 3642699618 ISBN-13(EAN): 9783642699610 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Magn?s M. Halld?rsson; Kazuo Iwama; Naoki Kobayash Название: Automata, Languages, and Programming ISBN: 3662476711 ISBN-13(EAN): 9783662476710 Издательство: Springer Рейтинг: Цена: 15653.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Japan, in July 2015. The papers are organized in the following three tracks: algorithms, complexity, and games;
Автор: Holt, Derek F. Rees, Sarah Rover, Claas E. Название: Groups, languages and automata ISBN: 1107152356 ISBN-13(EAN): 9781107152359 Издательство: Cambridge Academ Рейтинг: Цена: 17424.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Many connections exist between group theory and automata theory, and a wide variety of them are discussed in this text. Any necessary background material is provided, and connections are explored along a number of strands that lead to the forefront of current research in geometric group theory.
Автор: Homenda Wladyslaw Название: Automata Theory and Formal Languages ISBN: 3110752271 ISBN-13(EAN): 9783110752274 Издательство: Walter de Gruyter Рейтинг: Цена: 9930.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
The book is a concise, self-contained and fully updated introduction to automata theory - a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students.
Описание: This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos.
Описание: This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos.
Автор: Alexander Meduna Название: Automata and Languages ISBN: 1852330740 ISBN-13(EAN): 9781852330743 Издательство: Springer Рейтинг: Цена: 20257.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Offers a step-by-step development of the theory of automata, languages and computation. Intended for use as the basis of an introductory course at both junior and senior levels, this text features basic models of computation, formal languages and their properties; computability, decidability and complexity; and design of programming languages.
Автор: Fedor V. Fomin; Rusins Freivalds; Marta Kwiatkowsk Название: Automata, Languages, and Programming ISBN: 3642392113 ISBN-13(EAN): 9783642392115 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This two-volume set of LNCS 7965 and LNCS 7966 constitutes the refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers presented were carefully reviewed and selected from 422 submissions.
Автор: Stoyan Mihov, Klaus U. Schulz Название: Finite-State Techniques: Automata, Transducers and Bimachines ISBN: 1108485413 ISBN-13(EAN): 9781108485418 Издательство: Cambridge Academ Рейтинг: Цена: 10611.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This text for graduate students and researchers gives a complete coverage of the field with mathematical rigour, from basics to advanced topics. It closes the gap between theory and real practice by providing full proofs and executable code for all algorithms, showcasing the efficient and elegant solutions that finite-state methods offer.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
