On the Minimality of Finite Automata and Stream X-machines for Finite Languages

Authors:
Florentin Ipate
Affiliations:
Department of Computer Science and Mathematics, University of Pitesti, Str Targu din Vale 1, 0300 Pitesti, Romania
Venue:
The Computer Journal
Year:
2005

Citing 0
Cited 3

Bounded sequence testing from deterministic finite state machines

Theoretical Computer Science
Learning finite cover automata from queries

Journal of Computer and System Sciences
Bounded sequence testing from non-deterministic finite state machines

TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A cover automaton of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. An algorithm for constructing a minimal cover automaton of a finite language L is given in a recent paper. This paper goes a step further by proposing a procedure for constructing all minimal cover automata of a given finite language L. The concept of cover automaton is then generalized to a form of extended finite automaton, the stream X-machine, and the procedure is extended to this more general model.