ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A parallel algorithm for the minimization of finite state automata

Srikant, YN (1990) A parallel algorithm for the minimization of finite state automata. In: International Journal of Computer Mathematics, 32 (2). pp. 1-11.

Full text not available from this repository.
Official URL: http://www.tandfonline.com/doi/abs/10.1080/0020716...

Abstract

A parallel algorithm for the set partitioning problem which has applications in the minimization of finite state automata is presented. The algorithm runs on a CREW PRAM in $O(log^2n)z$ time and requires 0(n) processors.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Taylor and Francis Group.
Keywords: Finite state automata;set partitioning;CREW PRAM parallel model;minimization
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 15 Jul 2007
Last Modified: 27 Jan 2012 05:59
URI: http://eprints.iisc.ernet.in/id/eprint/11535

Actions (login required)

View Item View Item