Cantitate/Preț
Produs

Regulated Grammars and Automata

Autor Alexander Meduna, Petr Zemek
en Limba Engleză Paperback – 3 sep 2016
This is the first book to offer key theoretical topics and terminology concerning regulated grammars and automata. They are the most important language-defining devices that work under controls represented by additional mathematical mechanisms. Key topics include formal language theory, grammatical regulation, grammar systems, erasing rules, parallelism, word monoids, regulated and unregulated automata and control languages. The book explores how the information utilized in computer science is most often represented by formal languages defined by appropriate formal devices. It provides both algorithms and a variety of real-world applications, allowing readers to understand both theoretical concepts and fundamentals. There is a special focus on applications to scientific fields including biology, linguistics and informatics. This book concludes with case studies and future trends for the field. Regulated Grammars and Automata is designed as a reference for researchers and professionals working in computer science and mathematics who deal with language processors. Advanced-level students in computer science and mathematics will also find this book a valuable resource as a secondary textbook or reference.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 63268 lei  38-44 zile
  Springer – 3 sep 2016 63268 lei  38-44 zile
Hardback (1) 64493 lei  38-44 zile
  Springer – 4 mar 2014 64493 lei  38-44 zile

Preț: 63268 lei

Preț vechi: 79085 lei
-20% Nou

Puncte Express: 949

Preț estimativ în valută:
12109 12587$ 10031£

Carte tipărită la comandă

Livrare economică 31 ianuarie-06 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781493943166
ISBN-10: 1493943162
Pagini: 714
Ilustrații: XX, 694 p. 12 illus.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.98 kg
Ediția:Softcover reprint of the original 1st ed. 2014
Editura: Springer
Colecția Springer
Locul publicării:New York, NY, United States

Cuprins

Introduction.- Mathematical Background.- Rudiments of Formal Language Theory.- Context-Based Grammatical Regulation.- Rule-Based Grammatical Regulation.- One-Sided Versions of Random Context Grammars.- On Erasing Rules and Their Elimination.- Extension of Languages Resulting from Regulated Grammars.- Sequential Rewriting over Word Monoids.- Regulated ET0L Grammars.- Uniform Regulated Rewriting in Parallel.- Parallel Rewriting over Word Monoids.- Regulated Multigenerative Grammar Systems.- Controlled Pure Grammar Systems.- Self-Regulating Automata.- Automata Regulated by Control Languages.- Jumping Finite Automata.- Deep Pushdown Automata.- Applications: Overview.- Case Studies.- Concluding Remarks.- Summary.

Recenzii

From the book reviews:
“The book consists of 22 chapters divided among nine parts. … The book is well written and produced, and should be warmly received by its community. Each chapter is accompanied by a bibliography, and the authors suggest many open problems that should be welcomed by researchers, especially graduate students just embarking on research.” (Shrisha Rao, Computing Reviews, November, 2014)

Caracteristici

Offers key theoretical topics and terminology concerning regulated grammars and automata Includes real-world applications and future trends in the field Covers easy-to-follow theoretical concepts and fundamentals Includes supplementary material: sn.pub/extras