Special Types of Context-Free Languages and Their Models

  • Alexander Meduna


This chapter investigates special types of context-free languages, resulting from some restricted models of pushdown automata and context-free grammars. Most importantly, the relationships between the context-free language subfamilies defined by these restricted models are studied. Section 7.1 examines the family of deterministic context-free languages, defined by deterministic pushdown automata. Section 7.2 reconsiders the family of regular languages and characterizes this family by three restricted variants of context-free grammars. Additionally, linear grammars are introduced, which define a proper superfamily of regular languages.


Regular Language Finite Automaton Closure Property Input Alphabet Deterministic Finite Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limited 2000

Authors and Affiliations

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

Personalised recommendations