A remark on regularity of parallel languages

DOI10.1080/00207168208803341zbMath0513.68068OpenAlexW2122322789MaRDI QIDQ3659170

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

decidabilityregular languageparallel languagesFTOL languageOL languagesparallel extensions of context-free grammars

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Problèmes decidables concernant les TOL-langages unaires
• Pure grammars
• Parallel context-free languages
• Some decidability problems of sentential formst †

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