Automata, Formal Languages And Algebraic Systems - Proceedings Of Aflas 2008, Ito Masami Et Al
Автор: 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.
Автор: M. Goldstein; Valery B. Kudryavtsev; Ivo G. Rosenb Название: Structural Theory of Automata, Semigroups, and Universal Algebra ISBN: 140203816X ISBN-13(EAN): 9781402038167 Издательство: Springer Рейтинг: Цена: 20263.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: 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.
Автор: Manfred Droste; Werner Kuich; Heiko Vogler Название: Handbook of Weighted Automata ISBN: 3642260497 ISBN-13(EAN): 9783642260490 Издательство: Springer Рейтинг: Цена: 27251.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications. The contributors are the leading experts in their respective areas. Chapters offer pointers to future research.
Автор: El Yacoubi Название: Cellular Automata ISBN: 331944364X ISBN-13(EAN): 9783319443645 Издательство: Springer Рейтинг: Цена: 9224.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 12th International Conference on Cellular Automata for Research and Industry, ACRI 2016, held in Fez, Morocco, in September 2014. The 45 full papers and 4 invited talks presented in this volume were carefully reviewed and selected from 59 submissions.
This volume contains invited contributions and accepted papers from the main track and from the three organized workshops.
The ?rst part is organized according to three topics: (1) Cellular Automata Theory and Implementation (2) Cellular Automata Dynamics and Synchronization, (3) Asynchronous Cellular Automata and Asynchronous Discrete Models - ACA. The second part of the volume contains three topics: (4) Modelling and Sim-ulation with Cellular Automata (5) Crowds, Tra?c and Cellular Automata –CT&CA (6) Agent-Based Simulation and Cellular Automata – ABS&CA.
Автор: P?l D?m?si Название: Algebraic Theory of Automata Networks ISBN: 0898715695 ISBN-13(EAN): 9780898715699 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 13919.00 р. Наличие на складе: Нет в наличии.
Описание: Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories. Automata networks are investigated as products of automata, and the fundamental results in regard to automata networks are surveyed and extended, including the main decomposition theorems of Letichevsky, and of Krohn and Rhodes. The text summarizes the most important results of the past four decades regarding automata networks and presents many new results discovered since the last book on this subject was published. Several new methods and special techniques are discussed, including characterization of homomorphically complete classes of automata under the cascade product; products of automata with semi-Letichevsky criterion and without any Letichevsky criteria; automata with control words; primitive products and temporal products; network completeness for digraphs having all loop edges; complete finite automata network graphs with minimal number of edges; and emulation of automata networks by corresponding asynchronous ones.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru