A description based on languages of the final non-deterministic automaton

Ballester‐Bolinches, A.; Llópez, Enric Cosme; Esteban‐Romero, R.

doi:10.1016/j.tcs.2014.01.018

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

2024

Publication Types

Select...

Article6

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 6 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…e category-theoretic tools and techniques have been used in the advancement of several features of theoretical computer science; specifically, in automata theory, the application of the categorical approach can be seen in (cf. [25,59,[65][66][67][68][69][70][71]). While in the case of fuzzy automata and fuzzy languages, category-theoretic studies were reported in [36-38, 44-46, 61, 72-75].…”

Section: Introductionmentioning

confidence: 99%

A General Categorical Framework of Minimal Realization Theory for a Fuzzy Multiset Language

Yadav

Tiwari

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper is to study the minimal realization theory for a fuzzy multiset language in the framework of category theory, which has already provided the tools and techniques for the advancement of several features of theoretical computer science. Specifically, by using the well-known categorical concepts, it is shown herein that there is a minimal realization (called the Nerode realization) for each fuzzy multiset language, and all minimal realizations for a given fuzzy multiset language are isomorphic to it.

show abstract