Nondeterministic Moore automata and Brzozowski’s minimization algorithm

Moore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing th...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 450; pp. 81 - 91
Main Authors: Castiglione, G., Restivo, A., Sciortino, M.
Format: Journal Article
Language:English
Published: Elsevier B.V 07.09.2012
Subjects:
Algorithms
Automata minimization
Automation
Brzozowski’s minimization algorithm
Coherence
Computer simulation
Construction
Equivalence
Minimization
Nondeterministic Moore automata
Optimization
Brzozowski’s minimization algorithm
Automata minimization
Nondeterministic Moore automata
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Moore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing the minimal deterministic Moore automaton equivalent to a given NMA. We propose an algorithm that is a variant of Brzozowski’s minimization algorithm in the sense that it is essentially structured as reverse operation and subset construction performed twice. Moreover, we explore more general classes of NMA and analyze the applicability of the algorithm. For some of such classes the algorithm does not return the minimal equivalent deterministic automaton.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2012.04.029