A Unique Operator-Topological Decomposition Framework for Lℬ-Valued General Fuzzy Automata

[Formula: see text]-valued general fuzzy automata provide a rich algebraic–topological framework for modeling systems with uncertainty and graded dynamics. This paper investigates the structural decomposition of [Formula: see text]-valued GFA through the lens of three fundamental operators: the successor operator [Formula: see text], the predecessor operator [Formula: see text], and the core operator [Formula: see text]. These operators induce dual topologies on the state space and allow us to establish a canonical decomposition theorem. We prove that every [Formula: see text]-valued GFA can be uniquely decomposed into the union of a regular-closed decomposable subautomaton and a predecessor (source-splitting) subautomaton. This result generalizes classical decomposition theorems for crisp automata such as the Krohn–Rhodes theorem to the [Formula: see text]-valued setting. The proposed framework bridges algebra and topology and opens new perspectives for future applications in soft computing and intelligent system modeling.

Authors

Publication Details

Journal
New Mathematics and Natural Computation
Published
2026-09-09
DOI
https://doi.org/10.1142/s1793005729500142
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Unique Operator-Topological Decomposition Framework for Lℬ-Valued General Fuzzy Automata

Kh. Abolpour, H. Bordbar
New Mathematics and Natural Computation
Formal Methods in Verification
article

A Unique Operator-Topological Decomposition Framework for Lℬ-Valued General Fuzzy Automata

Kh. Abolpour, H. Bordbar
article en

Abstract

[Formula: see text]-valued general fuzzy automata provide a rich algebraic–topological framework for modeling systems with uncertainty and graded dynamics. This paper investigates the structural decomposition of [Formula: see text]-valued GFA through the lens of three fundamental operators: the successor operator [Formula: see text], the predecessor operator [Formula: see text], and the core operator [Formula: see text]. These operators induce dual topologies on the state space and allow us to establish a canonical decomposition theorem. We prove that every [Formula: see text]-valued GFA can be uniquely decomposed into the union of a regular-closed decomposable subautomaton and a predecessor (source-splitting) subautomaton. This result generalizes classical decomposition theorems for crisp automata such as the Krohn–Rhodes theorem to the [Formula: see text]-valued setting. The proposed framework bridges algebra and topology and opens new perspectives for future applications in soft computing and intelligent system modeling.

New Mathematics and Natural Computation
Openalex Percentile: Top 9%
Formal Methods in Verification
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.