Cover Image

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Löding, Christof, Walukiewicz, Igor
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory F.4.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
by: Löding, Christof, et al.
Published: (2022)

On the Boolean Closure of Deterministic Top-Down Tree Automata
by: Löding, Christof, et al.
Published: (2024)

Layered automata: A canonical model for automata over infinite words
by: Casares, Antonio, et al.
Published: (2026)

On History-Deterministic One-Counter Nets
by: Prakash, Keya, et al.
Published: (2022)

Learning Realtime One-Counter Automata
by: Bruyère, Véronique, et al.
Published: (2021)

Automata with Timers
by: Bruyère, Véronique, et al.
Published: (2023)

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
by: Doveri, Kyveli, et al.
Published: (2024)

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

Eve-positional languages: putting order into Büchi automata
by: Idir, Olivier
Published: (2026)

Learning Deterministic One-Counter Automata in Polynomial Time
by: Mathew, Prince, et al.
Published: (2025)

Active Learning Techniques for Pomset Recognizers
by: Pommellet, Adrien, et al.
Published: (2025)

Active Learning of Upward-Closed Sets of Words
by: Aristote, Quentin
Published: (2025)

On Repetitive Finite Automata with Translucent Words
by: Mráz, František, et al.
Published: (2025)

Learning Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2025)

Active Automata Learning with Advice
by: Fica, Michał, et al.
Published: (2025)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
by: Deng, Zhibo, et al.
Published: (2025)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
by: Bojańczyk, Mikołaj, et al.
Published: (2021)

Store Languages of Turing Machines and Counter Machines
by: Friesen, Noah, et al.
Published: (2025)

Omega-Regular Robustness
by: Fisman, Dana, et al.
Published: (2025)

Runtime Consultants
by: Fisman, Dana, et al.
Published: (2025)

Algebraic Language Theory with Effects
by: Lenke, Fabian, et al.
Published: (2024)

Commuting upper triangular binary morphisms
by: Honkala, Juha
Published: (2023)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
by: Fisman, Dana, et al.
Published: (2023)

Deciding DFA-Primality is NP-Hard
by: Spenner, Daniel Alexander
Published: (2026)

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
by: Udupa, Sumukha, et al.
Published: (2024)

Verifying Unboundedness via Amalgamation
by: Anand, Ashwani, et al.
Published: (2024)

Monads, Comonads, and Transducers
by: Stefański, Rafał
Published: (2024)

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
by: Havel, Martin, et al.
Published: (2024)

Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages
by: Hopkins, Mark, et al.
Published: (2023)

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

Jump Complexity of Deterministic Finite Automata with Translucent Letters
by: Fazekas, Szilárd Zsolt, et al.
Published: (2025)

Decomposition of Automata recognizing Ideals
by: Berry, Mathias, et al.
Published: (2026)

Alternating Nominal Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2024)

Nominal Tree Automata With Name Allocation
by: Prucker, Simon, et al.
Published: (2024)

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

Learning real-time one-counter automata using polynomially many queries
by: Mathew, Prince, et al.
Published: (2024)

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

Parsing Hypergraphs using Context-Free Positional Grammars
by: Costagliola, Gennaro, et al.
Published: (2026)

Various Types of Comet Languages and their Application in External Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2024)

Introducing Divergence for Infinite Probabilistic Models
by: Finkel, Alain, et al.
Published: (2023)