Parallelisable Regular Languages
N. Mohana, Kalyani Desikan, Vincent Rajkumar Dare · IOP Conference Series Materials Science and Engineering · 2021
Abstract In this paper, we have defined Parallelisable strings and languages in order to reduce the recognition time of strings. Parallelisable languages have been introduced and their recognition has been studied through parallelisable finite automaton. We have restricted our study to languages that comprise of words that contain a common subword. By introducing parallelism on the subword we have been able to reduce the recognition time. Also, we have studied the properties of parallel regular languages.