Recursion and pumping in L forms

DOI10.1016/0020-0255(81)90011-6MaRDI QIDQ1157970zbMATH OpenOpenAlexFDO

Authors Grzegorz Rozenberg, R. Verraedt

Publication date 1981

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(81)90011-6

zbMATH Keywords

pumped languagerecursion limited OL system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3733286 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 3617584 (Why is no real title available?)
• scientific article; zbMATH DE number 3800951 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Completeness of EOL forms is decidable
• EOL forms
• Good OL forms
• Grammar and L forms: an introduction
• Pumping Lemmas for Regular Sets
• Pumping languages^†
• Sub context-freeLforms^†
• Uniform interpretations of L forms

This page was built for publication: Recursion and pumping in L forms

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