Image de couverture de livre

Soft state reduction of fuzzy automata over residuated lattices

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Nguyen, Linh Anh, Cao, Son Thanh, Stanimirović, Stefan
Format:	Preprint
Publié:	2025
Sujets:	Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The complexity of reachability problems in strongly connected finite automata
par: Kiefer, Stefan, et autres
Publié: (2025)

Database-assisted automata learning
par: Walinga, Hielke, et autres
Publié: (2024)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
par: Zhang, Kuize, et autres
Publié: (2024)

Cerny type automata and rank conjecture
par: Rystsov, Igor
Publié: (2025)

Deterministic Parikh automata on infinite words
par: Grobler, Mario, et autres
Publié: (2024)

Conway's cosmological theorem and automata theory
par: Lairez, Pierre, et autres
Publié: (2024)

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

The complexity of separability for semilinear sets and Parikh automata
par: Collins, Elias Rojas, et autres
Publié: (2024)

Non-deterministic asynchronous automata games and their undecidability
par: Adsul, Bharat, et autres
Publié: (2024)

Diagnosability of labeled $\mathfrak{D_p}$ automata
par: Zhang, Kuize, et autres
Publié: (2021)

Nondeterminism makes unary 1-limited automata concise
par: Guillon, Bruno, et autres
Publié: (2025)

Characterizing normality via automata and random matrix products
par: Bienvenu, Laurent, et autres
Publié: (2026)

The structure of polynomial growth for tree automata/transducers and MSO set queries
par: Gallot, Paul, et autres
Publié: (2025)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
par: Bell, Jason P., et autres
Publié: (2022)

Two-way affine automata can verify every language
par: Chen, Zeyu, et autres
Publié: (2025)

Exact descriptional complexity of determinization of input-driven pushdown automata
par: Martynova, Olga
Publié: (2024)

Deterministic pushdown automata can compress some normal sequences
par: Carton, Olivier, et autres
Publié: (2022)

Cluster automata
par: Kornai, András
Publié: (2025)

State estimation of timed automata under partial observation [Draft version]
par: Gao, Chao, et autres
Publié: (2024)

Execution-time opacity problems in one-clock parametric timed automata
par: André, Étienne, et autres
Publié: (2024)

Quantum finite automata and linear context-free languages: a decidable problem
par: Bertoni, A., et autres
Publié: (2013)

Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
par: Briones, Laura Brandán, et autres
Publié: (2025)

Saturating automata for game semantics
par: Dixon, Alex, et autres
Publié: (2023)

Completely reachable automata: a quadratic decision algorithm and a quadratic upper bound on the reaching threshold
par: Ferens, Robert, et autres
Publié: (2022)

Completeness for categories of generalized automata
par: Boccali, Guido, et autres
Publié: (2023)

A study on the composition of elementary cellular automata
par: Castillo-Ramirez, Alonso, et autres
Publié: (2023)

The Agafonov and Schnorr-Stimm theorems for probabilistic automata
par: Bienvenu, Laurent, et autres
Publié: (2025)

On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
par: Dennunzio, Alberto, et autres
Publié: (2026)

Idempotent cellular automata and their natural order
par: Castillo-Ramirez, Alonso, et autres
Publié: (2024)

Equality of cycle lengths in one- and two-dimensional $σ$ automata
par: Vadali, Avi, et autres
Publié: (2025)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
par: Petrov, Semyon, et autres
Publié: (2024)

Entropy of pebble automata and space complexity
par: Montoya, J. Andres
Publié: (2026)

Cellular automata can really solve the parity problem
par: Wolnik, Barbara, et autres
Publié: (2025)

Twinning automata and regular expressions for string static analysis
par: Negrini, Luca, et autres
Publié: (2020)

Reversible Transducers over Infinite Words
par: Dartois, Luc, et autres
Publié: (2024)

Nondeterministic state complexity of square root
par: Onishchenko, Sergey
Publié: (2026)

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

Minimizing Cost Register Automata over a Field
par: Benalioua, Yahia Idriss, et autres
Publié: (2023)

Learning Weighted Automata over Number Rings, Concretely and Categorically
par: Aristote, Quentin, et autres
Publié: (2025)

A pumping-like lemma for languages over infinite alphabets
par: Danieli, Yoav
Publié: (2025)