Control sets on grammars using depth-first derivations

DOI10.1007/BF01744305zbMath0411.68064MaRDI QIDQ4198079

Mark Luker

Publication date: 1980

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

context-free languageabstract family of languagesregular setSzilard languagedepth-first derivationscontrol sets on grammarsderivation-bounded languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Interprocedural Reachability for Flat Integer Programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Control sets on context-free grammar forms
• Left-derivation bounded languages
• Derivation-bounded languages
• Some problems of finite representability
• Control sets on grammars
• Periodically time-variant context-free grammars
• Associate languages and derivational complexity of formal grammars and languages
• Phrase structure languages, finite machines, and channel capacity

This page was built for publication: Control sets on grammars using depth-first derivations