Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Fuzzy Finite State Automaton with Unique Membership Transition on an Input Symbo

T. Rajaretnam1, S. K. Ayyaswamy1
1P. G. and Research Department of Mathematics St. Joseph’s College (Autonomous) Tiruchirappalli – 620 002, India.
  • Published: 31/05/2009

Abstract

In this paper, fuzzy finite state automaton with unique membership transition on an input symbol (uffsa) is defined. It is proved and illustrated that for a given fuzzy finite state automaton (ffsa), there exists an equivalent uffsa. Some closure properties of fuzzy regular languages are studied.

Keywords: Fuzzy finite state automaton, fuzzy regular languages.
Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
T. Rajaretnam, S. K. Ayyaswamy. Fuzzy Finite State Automaton with Unique Membership Transition on an Input Symbo[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 069. 151-164. DOI: .