Open AccessParallelisable Regular Languages
Author(s) -
N. Mohana,
Kalyani Desikan,
V. R. Dare
Publication year - 2021
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/1012/1/012060
Subject(s) - computer science , automaton , parallelism (grammar) , regular language , natural language processing , programming language , artificial intelligence , parallel computing
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.