Header menu link for other important links
Parallelisable String-Based SP-Local Languages and their properties
Published in Badih/Ghusayni, Ed. & Pub.
Volume: 15
Issue: 4
Pages: 1321 - 1325
Scanners are a special class of automata and considered as computational models which accept local information. A local language is defined by the factors of its words of length two and can be generalized by Locally Testable Languages. A natural computation on sequential tasks is concatenation; it models a system finishing one task and then starting another one. We have adopted parallelism to model the tasks of a sequential system because this methodology enables computational tasks to be completed using various types of multiple resources simultaneously. Parallel computing has become an important concept in computer architecture. The classification of parallel computers is based on the level at which parallelism is supported by the hardware. We have introduced parallelisable string-based SP-languages as the collection of series parallel languages and parallel series languages. Parallelisable string-based SP-local language has been defined and their acceptance or recognition on parallelisable string-based SP-regular grammar has been proved. © 2020. All Rights Reserved.
About the journal
JournalInternational Journal of Mathematics and Computer Science
PublisherBadih/Ghusayni, Ed. & Pub.