Weighted Automata Induced By A Graph

This paper presents a new weighted automaton that is created based on a graph, known as a weighted graphautomaton, and explores the different behaviors exhibited by different types of weighted graph automaton. Throughresearch conducted, it has been demonstrated that if two graphs are isomorphic, the corresponding weighted graphautomata are equivalent but not necessarily vice versa.

کلیدواژه ها:

Weighted automata ، Weighted graph automata ، Unified graph