Zum Hauptinhalt springen
Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Regulated Grammars and Automata - Alexander Meduna, Petr Zemek

Regulated Grammars and Automata (eBook)

eBook Download: PDF
2014
XX, 694 Seiten
Springer New York (Verlag)
978-1-4939-0369-6 (ISBN)
Systemvoraussetzungen
96,29 inkl. MwSt
(CHF 93,95)
Der eBook-Verkauf erfolgt durch die Lehmanns Media GmbH (Berlin) zum Preis in Euro inkl. MwSt.
  • Download sofort lieferbar
  • Zahlungsarten anzeigen
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.
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.

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.

Erscheint lt. Verlag 8.7.2014
Zusatzinfo XX, 694 p. 12 illus.
Verlagsort New York
Sprache englisch
Themenwelt Geisteswissenschaften Sprach- / Literaturwissenschaft
Informatik Software Entwicklung User Interfaces (HCI)
Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik
Technik
Schlagworte algorithms • Automata • Control languages • Deep pushdown automata • Formal applications • Grammars • Linguistics • Parallel • Programmed grammars • regulated • Scattered context grammars • Self-regulating finite automata • theoretical computer science
ISBN-10 1-4939-0369-1 / 1493903691
ISBN-13 978-1-4939-0369-6 / 9781493903696
Informationen gemäß Produktsicherheitsverordnung (GPSR)
Haben Sie eine Frage zum Produkt?
PDFPDF (Wasserzeichen)

DRM: Digitales Wasserzeichen
Dieses eBook enthält ein digitales Wasser­zeichen und ist damit für Sie persona­lisiert. Bei einer missbräuch­lichen Weiter­gabe des eBooks an Dritte ist eine Rück­ver­folgung an die Quelle möglich.

Dateiformat: PDF (Portable Document Format)
Mit einem festen Seiten­layout eignet sich die PDF besonders für Fach­bücher mit Spalten, Tabellen und Abbild­ungen. Eine PDF kann auf fast allen Geräten ange­zeigt werden, ist aber für kleine Displays (Smart­phone, eReader) nur einge­schränkt geeignet.

Systemvoraussetzungen:
PC/Mac: Mit einem PC oder Mac können Sie dieses eBook lesen. Sie benötigen dafür einen PDF-Viewer - z.B. den Adobe Reader oder Adobe Digital Editions.
eReader: Dieses eBook kann mit (fast) allen eBook-Readern gelesen werden. Mit dem amazon-Kindle ist es aber nicht kompatibel.
Smartphone/Tablet: Egal ob Apple oder Android, dieses eBook können Sie lesen. Sie benötigen dafür einen PDF-Viewer - z.B. die kostenlose Adobe Digital Editions-App.

Buying eBooks from abroad
For tax law reasons we can sell eBooks just within Germany and Switzerland. Regrettably we cannot fulfill eBook-orders from other countries.

Mehr entdecken
aus dem Bereich
Künstliche Intelligenz rechtskonform im privaten und öffentlichen …

von Natascha Windholz

eBook Download (2024)
Carl Hanser Fachbuchverlag
CHF 68,35
Implement expert-level techniques for high-performance graphics with …

von Sergey Kosarevsky; Viktor Latypov; Alexey Medvedev

eBook Download (2025)
Packt Publishing (Verlag)
CHF 29,30