An assessment of algorithms for deriving failure deterministic finite automata

Failure deterministic finite automata (FDFAs) represent regular languages more compactly than deterministic finite automata (DFAs). Four algorithms that convert arbitrary DFAs to language-equivalent FDFAs are empirically investigated. Three are concrete variants of a previously published abstract al...

Full description

Bibliographic Details

Published in:	South African computer journal = Suid-Afrikaanse rekenaartydskrif Vol. 29; no. 1; pp. 43 - 68
Main Authors:	Nxumalo, Madoda, Kourie, Derrick G., Cleophas, Loek, Watson, Bruce W.
Format:	Journal Article
Language:	English
Published:	Makhanda South African Computer Society (SAICSIT) 01.07.2017 South African Institute of Computer Scientists and Information Technologists
Subjects:	Algorithms Failure deterministic finite automata Random automata
ISSN:	1015-7999, 2313-7835
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!