Direct Building of Minimal Automaton for a Given List

Direct Building of Minimal Automaton for a Given List (0)

Cached

Download Links

by Stoyan Mihov , Sv. Kliment Ohridski , Fakultet Po , Matematika I Informatika , Kniga Matematika I Mehanika , Annuaire De , L'universite De Sofia , St. Kliment Ohridski

Citations:

9 - 3 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Direct Building of Minimal Automaton for a Given List	user correction - Legacy Corrections
AUTHOR NAME	Stoyan Mihov	user correction - Legacy Corrections
AUTHOR NAME	Sv. Kliment Ohridski	user correction - Legacy Corrections
AUTHOR AFFIL	FACULTE DE MATHEMATIQUES ET INFORMATIQUE	user correction - Legacy Corrections
AUTHOR ADDR	Livre 1--- Math'ematiques et Mecanique; Tome 91, 1997	user correction - Legacy Corrections
AUTHOR NAME	Fakultet Po	user correction - Legacy Corrections
AUTHOR NAME	Matematika I Informatika	user correction - Legacy Corrections
AUTHOR NAME	Kniga Matematika I Mehanika	user correction - Legacy Corrections
AUTHOR NAME	Annuaire De	user correction - Legacy Corrections
AUTHOR NAME	L'universite De Sofia	user correction - Legacy Corrections
AUTHOR NAME	St. Kliment Ohridski	user correction - Legacy Corrections
AUTHOR ADDR	1. INTODUCTION	user correction - Legacy Corrections
ABSTRACT	This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. The size of the temporary automata which are necessary for the construction is less than the size of the resulting minimal automata plus the length of one of the longest words in the list. This property is the main advantage of our method.	SVM HeaderParse 0.1
YEAR	0	user correction - Legacy Corrections
CITATIONS	3 found	ParsCit 1.0