Special Types of Context-Free Languages and Their Models
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.
KeywordsPrefix Decid Suffix Fami
Unable to display preview. Download preview PDF.