cam a22 5 4500 317159763 CHVBK 20201009192933.0 m d cr |n |||||||| 140625s2014 xxu|||| s 0 0|eng d 978-1-4939-0369-6 978-1-4939-0368-9 (print) 10.1007/978-1-4939-0369-6 doi (SERSOL)ssj0001186559 (IDSSG)000655372 (WaSeSS)ssj0001186559 WaSeSS QA75.5-76.95 UY bicssc UYA bicssc COM014000 bisacsh COM031000 bisacsh 004.0151 23 CH0012D8CAC4D7C7F6C33C1257F070070167B iCapture Meduna Alexander author Regulated Grammars and Automata [Elektronische Daten] by Alexander Meduna, Petr Zemek New York, NY Springer New York Imprint: Springer 2014 1 online resource (XX, 694 p. 12 illus.) online resource text file PDF rda 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. Lizenzbedingungen können den Zugang einschränken. License restrictions may limit access. 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. Computer science Information theory Computational complexity Zemek Petr author SpringerLink (Online service) Printed edition 9781493903689 https://link.springer.com/10.1007/978-1-4939-0369-6 Uni Basel: Volltext BK020053 XK020053 XK020000 Springer Computer Science eBooks 2014 English/International E-Books von 360MarcUpdates noalma ids I IDSSG HSG HSG ONL HONL000655372 IDSBB A145 A145 145VT IDSBB 100 1- Meduna Alexander author IDSBB 700 1- Zemek Petr author IDSBB 710 2- SpringerLink (Online service) IDSBB 776 08 Printed edition 9781493903689 IDSBB 856 40 https://link.springer.com/10.1007/978-1-4939-0369-6 Uni Basel: Volltext IDSSG 700 1- Meduna Alexander IDSSG 700 1- Zemek Petr IDSSG 856 4- https://doi.org/10.1007/978-1-4939-0369-6 Full text for the University of St. Gallen SWISSBIB 317159763