A remark on regularity of parallel languages

DOI10.1080/00207168208803341MaRDI QIDQ3659170zbMATH OpenOpenAlexFDO

Authors Keijo Ruohonen

Publication date 1983

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168208803341

zbMATH Keywords

decidabilityFTOL languageOL languagesparallel extensions of context-free grammarsparallel languagesregular language

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Parallel context-free languages
• Problèmes decidables concernant les TOL-langages unaires
• Pure grammars
• Some decidability problems of sentential formst †

This page was built for publication: A remark on regularity of parallel languages

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