IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i3p272-d489526.html
   My bibliography  Save this article

Fuzzy Automata as Coalgebras

Author

Listed:
  • Ai Liu

    (Graduate School of Advanced Science and Engineering, Hiroshima University, Hiroshima 739-8511, Japan)

  • Shun Wang

    (School of Mathematical Sciences, Peking University, Beijing 100871, China)

  • Luis Soares Barbosa

    (INL (International Iberian Nanotechnology Laboratory) & INESC TEC, Universidade do Minho, 4704-553 Braga, Portugal)

  • Meng Sun

    (School of Mathematical Sciences, Peking University, Beijing 100871, China)

Abstract

The coalgebraic method is of great significance to research in process algebra, modal logic, object-oriented design and component-based software engineering. In recent years, fuzzy control has been widely used in many fields, such as handwriting recognition and the control of robots or air conditioners. It is then an interesting topic to analyze the behavior of fuzzy automata from a coalgebraic point of view. This paper models different types of fuzzy automata as coalgebras with a monad structure capturing fuzzy behavior. Based on the coalgebraic models, we can define a notion of fuzzy language and consider several versions of bisimulation for fuzzy automata. A group of combinators is defined to compose fuzzy automata of two branches: state transition and output function. A case study illustrates the coalgebraic models proposed and their composition.

Suggested Citation

  • Ai Liu & Shun Wang & Luis Soares Barbosa & Meng Sun, 2021. "Fuzzy Automata as Coalgebras," Mathematics, MDPI, vol. 9(3), pages 1-21, January.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:3:p:272-:d:489526
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/3/272/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/3/272/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Anupam K. Singh & S. P. Tiwari, 2020. "Fuzzy Regular Languages Based on Residuated Lattice," New Mathematics and Natural Computation (NMNC), World Scientific Publishing Co. Pte. Ltd., vol. 16(02), pages 363-376, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:3:p:272-:d:489526. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.