Language properties and Grammar of Parallel and Series Parallel Languages
N. Mohana, Kalyani Desikan, V. Rajkumar Dare

TL;DR
This paper explores the theoretical properties of parallel and series parallel languages, including their grammar and recognizability, to enhance understanding of their role in parallel processing and programming applications.
Contribution
It introduces formal definitions, grammars, and recognizability criteria for parallel and series parallel languages, expanding the theoretical framework of these language classes.
Findings
Defined regular expressions and context-free grammars for these languages
Analyzed recognizability using regular expressions and grammars
Established foundational properties relevant to parallel processing
Abstract
In this paper we have defined the language theoretical properties of Parallel languages and series parallel languages. Parallel languages and Series parallel languages play vital roles in parallel processing and many applications in computer programming. We have defined regular expressions and context free grammar for parallel and series parallel languages based on sequential languages [2]. We have also discussed the recognizability of parallel and series parallel languages using regular expression and regular grammar.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Interconnection Networks and Systems · Cellular Automata and Applications
