Cover Image

Determinization of Min-Plus Weighted Automata is Decidable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Almagor, Shaull, Arbel, Guy, Sheinvald, Sarai
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Complexity Bound for Determinisation of Min-Plus Weighted Automata
by: Almagor, Shaull, et al.
Published: (2026)

Unambiguisability and Register Minimisation of Min-Plus Models
by: Almagor, Shaull, et al.
Published: (2025)

Quantitative Semantics for Jumping Automata
by: Almagor, Shaull, et al.
Published: (2024)

Simulation by Rounds of Letter-to-Letter Transducers
by: Nassar, Antonio Abu, et al.
Published: (2021)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
by: Guha, Shibashis, et al.
Published: (2026)

Discounted-Sum Automata with Multiple Discount Factors
by: Boker, Udi, et al.
Published: (2023)

Feasability of Learning Weighted Automata on a Semiring
by: Daviaud, Laure, et al.
Published: (2023)

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata
by: Jecker, Ismaël, et al.
Published: (2023)

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
by: Holík, Lukáš, et al.
Published: (2025)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Decidability Problems for Micro-Stipula
by: Delzanno, Giorgio, et al.
Published: (2025)

Rerailing Automata
by: Ehlers, Rüdiger
Published: (2025)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

Characterization and Decidability of FC-Definable Regular Languages
by: Thompson, Sam M., et al.
Published: (2025)

Negated String Containment is Decidable (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2025)

Automata on $S$-adic words
by: Berthé, Valérie, et al.
Published: (2025)

Intersecting Dense Automata
by: Chistikov, Dmitry, et al.
Published: (2026)

On Good-for-MDPs Automata
by: Schewe, Sven, et al.
Published: (2022)

Inferring Symbolic Automata
by: Fisman, Dana, et al.
Published: (2021)

Deciding the synthesis problem for hybrid games through bisimulation
by: Dima, Catalin, et al.
Published: (2024)

Variants of Higher-Dimensional Automata
by: Bazille, Hugo, et al.
Published: (2026)

History-deterministic Timed Automata
by: Bose, Sougata, et al.
Published: (2023)

Fibrational Perspectives on Determinization of Finite-State Automata
by: Li, Thea
Published: (2024)

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
by: Czerwiński, Wojciech, et al.
Published: (2022)

Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)

Knowledge Compilation for Quantification in Alternating Automata
by: Akshay, S., et al.
Published: (2026)

Logic and Languages of Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2024)

Arbitrary-arity Tree Automata and QCTL
by: Laroussinie, François, et al.
Published: (2024)

Bisimulations and Logics for Higher-Dimensional Automata
by: Zouari, Safa, et al.
Published: (2024)

Automating the Analysis of Quantitative Automata with QuAK
by: Chalupa, Marek, et al.
Published: (2025)

Characterizing the Polynomial-Time Minimizable $ω$-Automata
by: Radi, Bader Abu, et al.
Published: (2025)

How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2026)

Invariants for One-Counter Automata with Disequality Tests
by: Chistikov, Dmitry, et al.
Published: (2024)

Decision Questions for Probabilistic Automata on Small Alphabets
by: Bell, Paul C., et al.
Published: (2021)

Random Deterministic Automata With One Added Transition
by: Carayol, Arnaud, et al.
Published: (2024)

Extending QuAK with Nested Quantitative Automata
by: Henzinger, Thomas A., et al.
Published: (2026)

Tree Automata Acceptance up to Measurable Defect
by: Moyasari, Anita, et al.
Published: (2026)

Unknown Biases and Timing Constraints in Timed Automata
by: Haase, Darion, et al.
Published: (2024)

Complementation of Emerson-Lei Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2024)