LEADER 04553nam 22006735 450 001 9910298566703321 005 20200629210800.0 010 $a1-4939-0369-1 024 7 $a10.1007/978-1-4939-0369-6 035 $a(CKB)3710000000092560 035 $a(EBL)1782009 035 $a(SSID)ssj0001186559 035 $a(PQKBManifestationID)11669385 035 $a(PQKBTitleCode)TC0001186559 035 $a(PQKBWorkID)11219049 035 $a(PQKB)10951583 035 $a(MiAaPQ)EBC1782009 035 $a(DE-He213)978-1-4939-0369-6 035 $a(PPN)177821914 035 $a(EXLCZ)993710000000092560 100 $a20140303d2014 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aRegulated Grammars and Automata /$fby Alexander Meduna, Petr Zemek 205 $a1st ed. 2014. 210 1$aNew York, NY :$cSpringer New York :$cImprint: Springer,$d2014. 215 $a1 online resource (691 p.) 300 $aDescription based upon print version of record. 311 $a1-322-13272-0 311 $a1-4939-0368-3 320 $aIncludes bibliographical references and indexes. 327 $aIntroduction -- 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. 330 $aThis 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. 606 $aComputers 606 $aMathematical logic 606 $aComputer science?Mathematics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 615 0$aComputers. 615 0$aMathematical logic. 615 0$aComputer science?Mathematics. 615 14$aTheory of Computation. 615 24$aComputation by Abstract Devices. 615 24$aMathematical Logic and Formal Languages. 615 24$aMathematics of Computing. 615 24$aDiscrete Mathematics in Computer Science. 676 $a004.0151 700 $aMeduna$b Alexander$4aut$4http://id.loc.gov/vocabulary/relators/aut$0993458 702 $aZemek$b Petr$4aut$4http://id.loc.gov/vocabulary/relators/aut 906 $aBOOK 912 $a9910298566703321 996 $aRegulated Grammars and Automata$92274712 997 $aUNINA