Control sets on grammars using depth-first derivations

DOI10.1007/BF01744305MaRDI QIDQ4198079zbMATH OpenFDO

Authors Mark Luker

Publication date 1980

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

Full work available at URL https://doi.org/10.1007/BF01744305

zbMATH Keywords

abstract family of languagescontext-free languagecontrol sets on grammarsdepth-first derivationsderivation-bounded languagesregular setSzilard language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Associate languages and derivational complexity of formal grammars and languages
• Control sets on context-free grammar forms
• Control sets on grammars
• Derivation-bounded languages
• scientific article; zbMATH DE number 3548463 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3298842 (Why is no real title available?)
• scientific article; zbMATH DE number 3307584 (Why is no real title available?)
• scientific article; zbMATH DE number 3313290 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Left-derivation bounded languages
• Periodically time-variant context-free grammars
• Phrase structure languages, finite machines, and channel capacity
• Some problems of finite representability

Cited in

(1)

• Interprocedural reachability for flat integer programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198079)