Regulated Grammars and Automata (Record no. 57406)

000 -LEADER
fixed length control field 03675nam a22005295i 4500
001 - CONTROL NUMBER
control field 978-1-4939-0369-6
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200421112221.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 140303s2014 xxu| s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9781493903696
-- 978-1-4939-0369-6
082 04 - CLASSIFICATION NUMBER
Call Number 004.0151
100 1# - AUTHOR NAME
Author Meduna, Alexander.
245 10 - TITLE STATEMENT
Title Regulated Grammars and Automata
300 ## - PHYSICAL DESCRIPTION
Number of Pages XX, 694 p. 12 illus.
505 0# - FORMATTED CONTENTS NOTE
Remark 2 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.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Mathematics.
700 1# - AUTHOR 2
Author 2 Zemek, Petr.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-1-4939-0369-6
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- New York, NY :
-- Springer New York :
-- Imprint: Springer,
-- 2014.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computers.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematical logic.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Science.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Theory of Computation.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computation by Abstract Devices.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematical Logic and Formal Languages.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematics of Computing.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Discrete Mathematics in Computer Science.
912 ## -
-- ZDB-2-SCS

No items available.