An Assessment of Algorithms for Deriving Failure Deterministic Finite Automata

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
Main Authors: Madoda Nxumalo, Derrick G Kourie, Loek Cleophas, Bruce W Watson
Format: Article
Language:English
Published: South African Institute of Computer Scientists and Information Technologists 2017-07-01
Series:South African Computer Journal
Subjects:
Failure deterministic finite automata
random automata
Online Access:http://sacj.cs.uct.ac.za/index.php/sacj/article/view/456

Similar Items

Similar Items