On Minimal Realizations of Neutrosophic Languages: A Categorical Approach

This paper develops a categorical framework for deterministic neutrosophic automata with neutrosophic outputs and their associated neutrosophic languages. Building upon neutrosophic set theory, which independently captures truth-membe rship, indeterminacy-membership, and falsity-membership, we introduce and systematically investigate the structural notions of run maps, reachability, and observability within this framework. Furthermore, two distinct approaches for constructing minimal realizations of a given neutrosophic language are presented and proven to be equivalent. These constructions yield canonical minimal automata and extend the classical Myhill-Nerode paradigm to the neutrosophic setting. The functorial relationships established between the categories of automata and languages provide a unified and robust theoretical foundation for modeling systems involving uncertainty and indeterminacy.

Authors

Publication Details

Journal
New Mathematics and Natural Computation
Published
2026-08-20
DOI
https://doi.org/10.1142/s1793005729500087
Primary Topic
Advanced Mathematical Theories
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Minimal Realizations of Neutrosophic Languages: A Categorical Approach

Anil Kumar Ram, Anupam K. Singh
New Mathematics and Natural Computation
Advanced Mathematical Theories
article

On Minimal Realizations of Neutrosophic Languages: A Categorical Approach

Anil Kumar Ram, Anupam K. Singh
article en

Abstract

This paper develops a categorical framework for deterministic neutrosophic automata with neutrosophic outputs and their associated neutrosophic languages. Building upon neutrosophic set theory, which independently captures truth-membe rship, indeterminacy-membership, and falsity-membership, we introduce and systematically investigate the structural notions of run maps, reachability, and observability within this framework. Furthermore, two distinct approaches for constructing minimal realizations of a given neutrosophic language are presented and proven to be equivalent. These constructions yield canonical minimal automata and extend the classical Myhill-Nerode paradigm to the neutrosophic setting. The functorial relationships established between the categories of automata and languages provide a unified and robust theoretical foundation for modeling systems involving uncertainty and indeterminacy.

New Mathematics and Natural Computation
Openalex Percentile: Top 4%
Advanced Mathematical Theories
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.