Research indexJournal article
Параллельные алгоритмы минимизации конечных автоматов для субрегулярных языков
Крайнюков
Известия Южного федерального университета. Технические науки1 Jan 2012
Параллельные алгоритмы минимизации конечных автоматов для субрегулярных языков
Крайнюков · Известия Южного федерального университета. Технические науки · 2012 · Subscription
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
Subregular languages are a subclass of regular languages with certain properties, the most important from the point of view of applications are finite languages, the languages are closed under taking prefixes, suffixes and subwords prefix suffix, factorial regular languages. Finite automata that recognize these languages, representing a subclass of automata, the states of finite automata have certain properties. We consider parallel algorithms for the minimization of finite automata for these languages. Parallelization is achieved by using the transition functions for each class of equivalent states. To investigate the possibilities of parallel algorithms uses a technology called MPI Parallel processes with message passing the most common parallel programming technology.