Skip to main content
SpringerLink
Log in

Regulated Grammars and Automata

  • Book
  • © 2014

Overview

Authors:
  1. Alexander Meduna

    1. Department of Information Systems, Brno University of Technology, Brno, Czech Republic

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Petr Zemek

    1. Department of Information Systems, Brno University of Technology, Brno, Czech Republic

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Offers key theoretical topics and terminology concerning regulated grammars and automata
  • Includes real-world applications and future trends in the field
  • Covers easy-to-follow theoretical concepts and fundamentals
  • Includes supplementary material: sn.pub/extras

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (22 chapters)

  1. Front Matter

    Pages i-xx
    Download chapter PDF

  2. Introduction and Terminology

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Chapter 1 Introduction

      • Alexander Meduna, Petr Zemek
      Pages 3-7

    3. Chapter 2 Mathematical Background

      • Alexander Meduna, Petr Zemek
      Pages 9-13

    4. Chapter 3 Rudiments of Formal Language Theory

      • Alexander Meduna, Petr Zemek
      Pages 15-36

  3. Regulated Grammars: Fundamentals

    1. Front Matter

      Pages 37-37
      Download chapter PDF

    2. Chapter 4 Context-Based Grammatical Regulation

      • Alexander Meduna, Petr Zemek
      Pages 39-154

    3. Chapter 5 Rule-Based Grammatical Regulation

      • Alexander Meduna, Petr Zemek
      Pages 155-187

  4. Regulated Grammars: Special Topics

    1. Front Matter

      Pages 189-189
      Download chapter PDF

    2. Chapter 6 One-Sided Versions of Random Context Grammars

      • Alexander Meduna, Petr Zemek
      Pages 191-279

    3. Chapter 7 On Erasing Rules and Their Elimination

      • Alexander Meduna, Petr Zemek
      Pages 281-328

    4. Chapter 8 Extension of Languages Resulting from Regulated Grammars

      • Alexander Meduna, Petr Zemek
      Pages 329-349

    5. Chapter 9 Sequential Rewriting Over Word Monoids

      • Alexander Meduna, Petr Zemek
      Pages 351-361

  5. Regulated Grammars: Parallelism

    1. Front Matter

      Pages 363-363
      Download chapter PDF

    2. Chapter 10 Regulated ET0L Grammars

      • Alexander Meduna, Petr Zemek
      Pages 365-429

    3. Chapter 11 Uniform Regulated Rewriting in Parallel

      • Alexander Meduna, Petr Zemek
      Pages 431-444

    4. Chapter 12 Parallel Rewriting Over Word Monoids

      • Alexander Meduna, Petr Zemek
      Pages 445-453

  6. Regulated Grammar Systems

    1. Front Matter

      Pages 455-455
      Download chapter PDF

    2. Chapter 13 Regulated Multigenerative Grammar Systems

      • Alexander Meduna, Petr Zemek
      Pages 457-489

    3. Chapter 14 Controlled Pure Grammar Systems

      • Alexander Meduna, Petr Zemek
      Pages 491-505
Back to top

Keywords

About this book

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.

Reviews

From the book reviews:

“The book consists of 22 chapters divided among nine parts. … The book is well written and produced, and should be warmly received by its community. Each chapter is accompanied by a bibliography, and the authors suggest many open problems that should be welcomed by researchers, especially graduate students just embarking on research.” (Shrisha Rao, Computing Reviews, November, 2014)

Authors and Affiliations

  • Department of Information Systems, Brno University of Technology, Brno, Czech Republic

    Alexander Meduna, Petr Zemek

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation