loading...
Automata over MV-Algebras
University of Toronto, Toronto, Canada May 19-May 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISMVL.2004.131991934th International Symposium on Multi ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Brunella Gerla, University of Salerno

We propose the notion of automata over Łukasiewicz many-valued logic, extending fuzzy automata ([9]).

Indeed, MV-algebras, i.e., algebraic structures related with many-valued Łukasiewicz logic, are made of two semiring reducts obtained considering the supremum operation together with the Łukasiewicz conjunction and the infimum operation together with Łukasiewicz disjunction. Vice-versa, given two semirings over the same domain, and given an isomorphism between these two algberas we can set some conditions in order to have an MV-algebra.

Following the tradition of semirings, in this paper we shall study "many-valued automata" and "many-valued formal languages" interpreted in Łukasiewicz logic.

Citation:
Brunella Gerla, "Automata over MV-Algebras," ismvl, pp.49-54, 34th International Symposium on Multiple-Valued Logic (ISMVL'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.