O'Reilly logo

Discrete Mathematics and Combinatorics by T. Sengadir

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 11

Formal Languages and Language Acceptors

Learning Objectives

On completing this chapter, you should be able to:

  • define the concept of a language

  • define a finite automaton

  • define the notion of a regular language

  • construct a finite automation that accepts a given regular language

  • identify the regular language accepted by a finite automaton

  • write down regular expressions for a given regular language

  • identify the regular lanauge represented by a given regular expression

  • define a pushdown automation

  • define the notion of a context-free language

  • construct pushdown automata for simple context-free languages

  • define a Turing machine

  • define a linear bounded automaton

  • define the notion of acontext-sensitive language

  • construct a linear bounded ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required