Regulated Grammars and Automata

  • Alexander Meduna
  • Petr Zemek

Table of contents

  1. Front Matter
    Pages i-xx
  2. Introduction and Terminology

    1. Front Matter
      Pages 1-1
    2. Alexander Meduna, Petr Zemek
      Pages 3-7
    3. Alexander Meduna, Petr Zemek
      Pages 9-13
    4. Alexander Meduna, Petr Zemek
      Pages 15-36
  3. Regulated Grammars: Fundamentals

    1. Front Matter
      Pages 37-37
    2. Alexander Meduna, Petr Zemek
      Pages 39-154
    3. Alexander Meduna, Petr Zemek
      Pages 155-187
  4. Regulated Grammars: Special Topics

    1. Front Matter
      Pages 189-189
    2. Alexander Meduna, Petr Zemek
      Pages 191-279
    3. Alexander Meduna, Petr Zemek
      Pages 281-328
    4. Alexander Meduna, Petr Zemek
      Pages 329-349
    5. Alexander Meduna, Petr Zemek
      Pages 351-361
  5. Regulated Grammars: Parallelism

    1. Front Matter
      Pages 363-363
    2. Alexander Meduna, Petr Zemek
      Pages 365-429
    3. Alexander Meduna, Petr Zemek
      Pages 431-444
    4. Alexander Meduna, Petr Zemek
      Pages 445-453
  6. Regulated Grammar Systems

    1. Front Matter
      Pages 455-455
    2. Alexander Meduna, Petr Zemek
      Pages 457-489
    3. Alexander Meduna, Petr Zemek
      Pages 491-505

About this book

Introduction

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.

Keywords

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

Authors and affiliations

  • Alexander Meduna
    • 1
  • Petr Zemek
    • 2
  1. 1.Department of Information SystemsBrno University of TechnologyBrnoCzech Republic
  2. 2.Department of Information SystemsBrno University of TechnologyBrnoCzech Republic

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4939-0369-6
  • Copyright Information Springer Science+Business Media New York 2014
  • Publisher Name Springer, New York, NY
  • eBook Packages Computer Science
  • Print ISBN 978-1-4939-0368-9
  • Online ISBN 978-1-4939-0369-6
  • About this book