Abstract
Parallelism is a process by which a sequential string is broken down into a number of alphabets and used to speed up the acceptance of a string. To identify the parallelisable string, we have used parallel operator || and defined the language as parallel series languages. Algebraic and recognition properties of series parallel posets have been studied by Lodaya in [8]. In this paper, we have introduced finite and infinite parallel series language (parallel strings are connected sequentially). We have considered the set of all parallel series language as topological space and prefix order relation (poset relation) has been used to relate two parallel series strings. Topological concepts like limit, sequence, open set, closed set and basis for parallel series languages and their properties have been derived.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
