Cover Image

Soft state reduction of fuzzy automata over residuated lattices

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nguyen, Linh Anh, Cao, Son Thanh, Stanimirović, Stefan
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The complexity of reachability problems in strongly connected finite automata
by: Kiefer, Stefan, et al.
Published: (2025)

Database-assisted automata learning
by: Walinga, Hielke, et al.
Published: (2024)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
by: Zhang, Kuize, et al.
Published: (2024)

Cerny type automata and rank conjecture
by: Rystsov, Igor
Published: (2025)

Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)

Conway's cosmological theorem and automata theory
by: Lairez, Pierre, et al.
Published: (2024)

Two or three things I know about tree transducers
by: Nguyên, Lê Thành Dũng
Published: (2024)

The complexity of separability for semilinear sets and Parikh automata
by: Collins, Elias Rojas, et al.
Published: (2024)

Non-deterministic asynchronous automata games and their undecidability
by: Adsul, Bharat, et al.
Published: (2024)

Diagnosability of labeled $\mathfrak{D_p}$ automata
by: Zhang, Kuize, et al.
Published: (2021)

Nondeterminism makes unary 1-limited automata concise
by: Guillon, Bruno, et al.
Published: (2025)

Characterizing normality via automata and random matrix products
by: Bienvenu, Laurent, et al.
Published: (2026)

The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
Published: (2025)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
by: Bell, Jason P., et al.
Published: (2022)

Two-way affine automata can verify every language
by: Chen, Zeyu, et al.
Published: (2025)

Exact descriptional complexity of determinization of input-driven pushdown automata
by: Martynova, Olga
Published: (2024)

Deterministic pushdown automata can compress some normal sequences
by: Carton, Olivier, et al.
Published: (2022)

Cluster automata
by: Kornai, András
Published: (2025)

State estimation of timed automata under partial observation [Draft version]
by: Gao, Chao, et al.
Published: (2024)

Execution-time opacity problems in one-clock parametric timed automata
by: André, Étienne, et al.
Published: (2024)

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)

Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
by: Briones, Laura Brandán, et al.
Published: (2025)

Saturating automata for game semantics
by: Dixon, Alex, et al.
Published: (2023)

Completely reachable automata: a quadratic decision algorithm and a quadratic upper bound on the reaching threshold
by: Ferens, Robert, et al.
Published: (2022)

Completeness for categories of generalized automata
by: Boccali, Guido, et al.
Published: (2023)

A study on the composition of elementary cellular automata
by: Castillo-Ramirez, Alonso, et al.
Published: (2023)

The Agafonov and Schnorr-Stimm theorems for probabilistic automata
by: Bienvenu, Laurent, et al.
Published: (2025)

On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
by: Dennunzio, Alberto, et al.
Published: (2026)

Idempotent cellular automata and their natural order
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)

Equality of cycle lengths in one- and two-dimensional $σ$ automata
by: Vadali, Avi, et al.
Published: (2025)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
by: Petrov, Semyon, et al.
Published: (2024)

Entropy of pebble automata and space complexity
by: Montoya, J. Andres
Published: (2026)

Cellular automata can really solve the parity problem
by: Wolnik, Barbara, et al.
Published: (2025)

Twinning automata and regular expressions for string static analysis
by: Negrini, Luca, et al.
Published: (2020)

Reversible Transducers over Infinite Words
by: Dartois, Luc, et al.
Published: (2024)

Nondeterministic state complexity of square root
by: Onishchenko, Sergey
Published: (2026)

On state complexity for subword-closed languages
by: Guyot, Jérôme
Published: (2024)

Minimizing Cost Register Automata over a Field
by: Benalioua, Yahia Idriss, et al.
Published: (2023)

Learning Weighted Automata over Number Rings, Concretely and Categorically
by: Aristote, Quentin, et al.
Published: (2025)

A pumping-like lemma for languages over infinite alphabets
by: Danieli, Yoav
Published: (2025)