Imagen de Portada

Hyper-Minimization for Deterministic Register Automata

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Yong, Tang, Qiyi, Yen, Di-De
Formato:	Preprint
Publicado:	2026
Materias:	Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Efficient Learning of Weak Deterministic Büchi Automata
por: Alluwayma, Mona, et al.
Publicado: (2025)

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

Resolving Nondeterminism by Chance
por: Paul, Soumyajit, et al.
Publicado: (2025)

Scalable Tree-based Register Automata Learning
por: Dierl, Simon, et al.
Publicado: (2024)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
por: Mazowiecki, Filip, et al.
Publicado: (2025)

On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
por: Casares, Antonio, et al.
Publicado: (2024)

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

History-Deterministic Büchi Automata are Succinct
por: Casares, Antonio, et al.
Publicado: (2026)

Learning Deterministic Multi-Clock Timed Automata
por: Teng, Yu, et al.
Publicado: (2024)

Token Games and History-Deterministic Quantitative-Automata
por: Boker, Udi, et al.
Publicado: (2021)

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
por: Acharya, Rohan, et al.
Publicado: (2024)

A Linear-time Simulation of Deterministic $d$-Limited Automata
por: Rubtsov, Alexander
Publicado: (2023)

Constructing Deterministic Parity Automata from Positive and Negative Examples
por: Bohn, León, et al.
Publicado: (2023)

The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently
por: Lehtinen, Karoliina, et al.
Publicado: (2025)

Saturation Problems for Families of Automata
por: Bohn, León, et al.
Publicado: (2025)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
por: Lacroce, Clara, et al.
Publicado: (2023)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
por: Löding, Christof, et al.
Publicado: (2025)

Mathematical Approach in Automata and Automata Association
por: Maciel, Sergio Henrique
Publicado: (2020)

Inference of Deterministic Finite Automata via Q-Learning
por: Hosseinkhani, Elaheh, et al.
Publicado: (2025)

Congruence-based Learning of Probabilistic Deterministic Finite Automata
por: Carrasco, Matías, et al.
Publicado: (2024)

Deterministic Suffix-reading Automata
por: Keerthan, R, et al.
Publicado: (2024)

Automata on Graph Alphabets
por: Bazille, Hugo, et al.
Publicado: (2026)

On Shuffling and Splitting Automata
por: Cunningham, Ignacio Mollo
Publicado: (2024)

Explorable Parity Automata
por: Hazard, Emile, et al.
Publicado: (2024)

Quantitative Language Automata
por: Henzinger, Thomas A., et al.
Publicado: (2025)

Asynchronism in Cellular Automata
por: Gautam, Virendra Kumar
Publicado: (2025)

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
por: De Rosa, Mattia, et al.
Publicado: (2025)

Learning EFSM Models with Registers in Guards
por: Vega, Germán, et al.
Publicado: (2024)

Localising Stochasticity in Weighted Automata
por: Agarwal, Smayan, et al.
Publicado: (2026)

Nominal Automata with Name Deallocation
por: Prucker, Simon, et al.
Publicado: (2026)

History-deterministic Parikh Automata
por: Erlich, Enzo, et al.
Publicado: (2022)

Determinism in Multi-Soliton Automata
por: Bordihn, Henning, et al.
Publicado: (2024)

Simulations for Event-Clock Automata
por: Akshay, S, et al.
Publicado: (2022)

Hyper pattern matching
por: Waga, Masaki, et al.
Publicado: (2025)

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

Minimising the Probabilistic Bisimilarity Distance
por: Kiefer, Stefan, et al.
Publicado: (2024)

Finite Automata for Efficient Graph Recognition
por: Drewes, Frank, et al.
Publicado: (2024)

Universality Frontier for Asynchronous Cellular Automata
por: Baburin, Ivan, et al.
Publicado: (2025)

Simulation Limitations of Affine Cellular Automata
por: Hudcová, Barbora, et al.
Publicado: (2023)

QuAK: Quantitative Automata Kit
por: Chalupa, Marek, et al.
Publicado: (2024)