Vol.1, No 4, 1997 pp. 491 - 496
UDC: 519.14
THEORY OF GRAPHS AND SOME POSSIBILITIES
OF FINITE AUTOMATES OPTIMIZATION
Miodrag M. Stojiljković1, Milorad V. Rančić2
1Mechanical Engineering Faculty, 18000 Niš, Beogradska Street,
14, Yugoslavia
1Higher School of Mechanical Engineering, 23000 Zrenjanin,
Dj. Stratimirović Street, 23, Yugoslavia
Abstract. The theory of graphs is a very suitable mathematical device
for describing finite automates. By defining and forming a finite automate
graph some problems of the finite automate algebra can be solved in a far
simpler way. This primarily refers to the possibility of optimizing by
the decomposition method by which a graph is decomposed in its substructures.
An algorithm has been formed by which a complex finite automate is decomposed
into subautomates with the ultimate aim of turning them into elementary
automates. All the considerations are at an abstract level.
TEORIJA GRAFOVA I NEKE MOGUĆNOSTI OPTIMIZACIJE
KONAČNIH AUTOMATA
Teorija grafova je veoma pogodan matematički aparat za opisivanje konačnih
automata. Kada se definiše i formira graf konačnog automata, neki problemi
algebre konačnih automata mogu da se reše daleko jednostavnije. To se pre
svega odnosi na mogućnosti optimizacije metodom dekompozicije, gde se graf
razbija na svoje podstrukture. Formiran je algoritam kojim se složeni konačni
automat razlaže na podautomate, sa krajnjim ciljem da to budu elementarni
automati. Sva razmatranja su na apstraktnom nivou.
