Abstract

Plus Weighted Finite State Automaton

Saridha. S1 and Rajaretnam. T2

1PG & Research Department of Mathematics, Cauvery College For Women, Trichy – 620018, Tamil Nadu, INDIA. 2PG & Research Department of Mathematics, St. Joseph’s College (Autonomous), Trichy – 620018, Tamil Nadu, INDIA.

DOI : http://dx.doi.org/10.29055/jcms/706

ABSTRACT

This paper introduces a plus weighted finite state automaton (pwfa) with weighted regular language. A plus weighted finite state automaton assigns a plus weighted values in which there is a unique weighted transition on an input symbol is considered. It is shown that for a given incomplete pwfa there exists an equivalent complete pwfa with same weighted regular language. Some Closure properties on pwfa are analyzed.

Keywords :Plus weighted finite state automaton, recognizability, weighted regular language.

map1 map2 map3