000 03849nam a22005175i 4500
001 vtls000541469
003 RU-ToGU
005 20210922081929.0
007 cr nn 008mamaa
008 160915s2014 xxu| s |||| 0|eng d
020 _a9781493903696
_9978-1-4939-0369-6
024 7 _a10.1007/978-1-4939-0369-6
_2doi
035 _ato000541469
040 _aSpringer
_cSpringer
_dRU-ToGU
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aMeduna, Alexander.
_eauthor.
_9445955
245 1 0 _aRegulated Grammars and Automata
_helectronic resource
_cby Alexander Meduna, Petr Zemek.
260 _aNew York, NY :
_bSpringer New York :
_bImprint: Springer,
_c2014.
300 _aXX, 694 p. 12 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
505 0 _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.
520 _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.
650 0 _aComputer Science.
_9155490
650 0 _aInformation theory.
_9303504
650 0 _aComputational complexity.
_9304814
650 1 4 _aComputer Science.
_9155490
650 2 4 _aTheory of Computation.
_9303507
650 2 4 _aComputation by Abstract Devices.
_9305111
650 2 4 _aMathematical Logic and Formal Languages.
_9303363
650 2 4 _aMathematics of Computing.
_9303612
650 2 4 _aDiscrete Mathematics in Computer Science.
_9304816
700 1 _aZemek, Petr.
_eauthor.
_9445956
710 2 _aSpringerLink (Online service)
_9143950
773 0 _tSpringer eBooks
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4939-0369-6
912 _aZDB-2-SCS
999 _c398764