Advertisement

Automata and Languages

Theory and Applications

  • Alexander Meduna

Table of contents

  1. Front Matter
    Pages i-xv
  2. Introduction

    1. Front Matter
      Pages 1-1
    2. Alexander Meduna
      Pages 3-23
    3. Alexander Meduna
      Pages 25-58
    4. Alexander Meduna
      Pages 59-90
  3. Regular Languages

    1. Front Matter
      Pages 91-91
    2. Alexander Meduna
      Pages 93-228
    3. Alexander Meduna
      Pages 229-266
  4. Context-Free Languages

    1. Front Matter
      Pages 267-267
    2. Alexander Meduna
      Pages 269-509
    3. Alexander Meduna
      Pages 511-563
  5. Beyond Context-Free Languages

    1. Front Matter
      Pages 607-607
    2. Alexander Meduna
      Pages 609-755
  6. Translations

    1. Front Matter
      Pages 757-757
    2. Alexander Meduna
      Pages 759-832
    3. Alexander Meduna
      Pages 833-887
  7. Back Matter
    Pages 889-916

About this book

Introduction

Automata and Languages presents a step-by-step development of the theory of automata, languages and computation. Intended to be used as the basis of an introductory course to this theory at both junior and senior levels, the text is organized in such a way as to allow the design of various courses based on selected material. Areas featured in the book include:- * basic models of computation * formal languages and their properties * computability, decidability and complexity * a discussion of the modern trends in the theory of automata and formal languages * design of programming languages, including the development of a new programming language * compiler design, including the construction of a complete compiler Alexander Meduna uses clear definitions, easy-to-follow proofs and helpful examples to make formerly obscure concepts easy to understand. He also includes challenging exercises and programming projects to enhance the reader's comprehension, and, to put the theory firmly into a 'real world' context, he presents lots of realistic illustrations and applications in practical computer science.

Keywords

Automat LA Turing algorithms automata complexity computability formal language programming language regular expressions

Authors and affiliations

  • Alexander Meduna
    • 1
  1. 1.Department of Computer Science and EngineeringTechnical University of BrnoBrnoCzech Republic

Bibliographic information