Finite Automata, Formal Logic, and Circuit Complexity, Howard Straubing
Автор: J. Richard B?chi; Dirk Siefkes Название: Finite Automata, Their Algebras and Grammars ISBN: 1461388554 ISBN-13(EAN): 9781461388555 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata.
The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Buchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud.
This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from theoretical computer science and mathematics. Theoretical computer science offers here topics such as decision problems and recognizability issues, whereas mathematics offers concepts such as discrete dynamical systems.
The main goal is to give a quick access, for students and researchers in mathematics or computer science, to actual research topics at the intersection between automata and formal language theory, number theory and combinatorics on words.
The second of two volumes on this subject, this book covers regular languages, numeration systems, formal methods applied to decidability issues about infinite words and sets of numbers.
Описание: The study of nonlinear dynamical systems has advanced tremendously in the last 20 years, making a big impact on science and technology. This book provides all the techniques and methods used in nonlinear dynamics. The concepts and underlying mathematics are discussed in detail. The numerical and symbolic methods are implemented in C++, SymbolicC++ and Java. Object-oriented techniques are also applied. The book contains more than 150 ready-to-run programs. The text has also been designed for a one-year course at both the junior and senior levels in nonlinear dynamics. The topics discussed in the book are part of e-learning and distance learning courses conducted by the International School for Scientific Computing.
Автор: Jean E. Pin Название: Formal Properties of Finite Automata and Applications ISBN: 354051631X ISBN-13(EAN): 9783540516316 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Focuses on different approaches for the modelling of parallel processes. On the one hand there are the so-called `process algebras` or `abstract programming languages` with Milner`s Calculus of Communicating Systems (CCS) and the theoretical version of Hoare`s Communicating Sequential Processes (CSP) as main representatives.
Автор: 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.
Описание: 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.
Автор: Arto Salomaa; Matti Soittola Название: Automata-Theoretic Aspects of Formal Power Series ISBN: 1461262666 ISBN-13(EAN): 9781461262664 Издательство: Springer Рейтинг: Цена: 11173.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: H. Brakhage Название: Automata Theory and Formal Languages ISBN: 3540074074 ISBN-13(EAN): 9783540074076 Издательство: Springer Рейтинг: Цена: 3213.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Presents recent developments of probabilistic assessment of systems dependability based on stochastic models, including graph theory, finite state automaton and language theory, for both dynamic and hybrid contexts. .
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
