000722548 000__ 03669cam\a2200469Ki\4500
000722548 001__ 722548
000722548 005__ 20230306140227.0
000722548 006__ m\\\\\o\\d\\\\\\\\
000722548 007__ cr\cn\nnnunnun
000722548 008__ 140318s2014\\\\nyu\\\\\ob\\\\001\0\eng\d
000722548 020__ $$a9781493903696$$qelectronic book
000722548 020__ $$a1493903691$$qelectronic book
000722548 020__ $$z9781493903689
000722548 020__ $$z1493903683
000722548 0247_ $$a10.1007/978-1-4939-0369-6$$2doi
000722548 035__ $$aSP(OCoLC)ocn873837339
000722548 035__ $$aSP(OCoLC)873837339
000722548 040__ $$aN$T$$beng$$erda$$epn$$cN$T$$dN$T$$dYDXCP$$dGW5XE$$dOCLCF$$dE7B$$dIDEBK$$dCDX$$dCOO$$dEBLCP
000722548 049__ $$aISEA
000722548 050_4 $$aQA267.3
000722548 08204 $$a005.1$$223
000722548 1001_ $$aMeduna, Alexander,$$d1957-$$eauthor.
000722548 24510 $$aRegulated grammars and automata$$h[electronic resource] /$$cAlexander Meduna, Petr Zemek.
000722548 264_1 $$aNew York :$$bSpringer,$$c[2014]
000722548 300__ $$a1 online resource (690 pages) :$$billustrations
000722548 336__ $$atext$$btxt$$2rdacontent
000722548 337__ $$acomputer$$bc$$2rdamedia
000722548 338__ $$aonline resource$$bcr$$2rdacarrier
000722548 504__ $$aIncludes bibliographical references and indexes.
000722548 5050_ $$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.
000722548 506__ $$aAccess limited to authorized users.
000722548 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.
000722548 588__ $$aDescription based on print version record.
000722548 650_0 $$aFormal languages.
000722548 650_0 $$aComputational linguistics.
000722548 650_0 $$aMachine theory.
000722548 7001_ $$aZemek, Petr,$$eauthor.
000722548 77608 $$iPrint version:$$aMeduna, Alexander.$$tRegulated grammars and automata. Alexander Meduna, Petr Zemek$$z1493903683$$w(OCoLC)873483555
000722548 852__ $$bebk
000722548 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-1-4939-0369-6$$zOnline Access$$91397441.1
000722548 909CO $$ooai:library.usi.edu:722548$$pGLOBAL_SET
000722548 980__ $$aEBOOK
000722548 980__ $$aBIB
000722548 982__ $$aEbook
000722548 983__ $$aOnline
000722548 994__ $$a92$$bISE