Skip to main content
  • Textbook
  • © 2000

Automata and Languages

Theory and Applications

Authors:

  • PRESENTS AN INTRODUCTION TO FUNDAMENTAL ABSTRACT MODELS BEHIND COMPUTATION IN A CLEAR, SIMPLE AND RIGOROUS WAY.
  • Includes supplementary material: sn.pub/extras

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as 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

Tax calculation will be finalised at checkout

Other ways to access

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

Table of contents (11 chapters)

  1. Front Matter

    Pages i-xv
  2. Introduction

    1. Front Matter

      Pages 1-1
    2. Mathematical Background

      • Alexander Meduna
      Pages 3-23
    3. Languages

      • Alexander Meduna
      Pages 25-58
    4. Automata

      • Alexander Meduna
      Pages 59-90
  3. Regular Languages

    1. Front Matter

      Pages 91-91
    2. Models for Regular Languages

      • Alexander Meduna
      Pages 93-228
    3. Properties of Regular Languages

      • Alexander Meduna
      Pages 229-266
  4. Context-Free Languages

    1. Front Matter

      Pages 267-267
    2. Models for Context-Free Languages

      • Alexander Meduna
      Pages 269-509
    3. Properties of Context-free Languages

      • Alexander Meduna
      Pages 511-563
  5. Beyond Context-Free Languages

    1. Front Matter

      Pages 607-607
    2. Generalized Models

      • Alexander Meduna
      Pages 609-755
  6. Translations

    1. Front Matter

      Pages 757-757
    2. Finite and Pushdown Transducers

      • Alexander Meduna
      Pages 759-832
    3. Turing Transducers

      • Alexander Meduna
      Pages 833-887
  7. Back Matter

    Pages 889-916

About this book

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.

Authors and Affiliations

  • Department of Computer Science and Engineering, Technical University of Brno, Brno, Czech Republic

    Alexander Meduna

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as 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

Tax calculation will be finalised at checkout

Other ways to access