Cover Image

The Complexity of Simplifying $ω$-Automata through the Alternating Cycle Decomposition

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Casares, Antonio, Mascle, Corto
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory Logic in Computer Science 68Q45 F.4.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The memory of $ω$-regular and BC($Σ_2^0$) objectives
by: Casares, Antonio, et al.
Published: (2025)

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
by: Casares, Antonio, et al.
Published: (2023)

Transition-based vs stated-based acceptance for automata over infinite words
by: Casares, Antonio
Published: (2025)

Positional $ω$-regular languages
by: Casares, Antonio, et al.
Published: (2024)

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

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
by: Deng, Zhibo, 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)

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

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

The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)

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

The complexity of downward closures of indexed languages
by: Mandel, Richard, et al.
Published: (2026)

Kleene Theorems for Lasso Languages and $ω$-Languages
by: Cruchten, Mike
Published: (2024)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
by: Guillon, Bruno, et al.
Published: (2025)

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

On universality of regular realizability problems
by: Rubtsov, Alexander, et al.
Published: (2023)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
by: Eickmeyer, Kord, et al.
Published: (2025)

Using games and universal trees to characterise the nondeterministic index of tree languages
by: Idir, Olivier, et al.
Published: (2025)

An algebraic characterisation of Eve-positional languages
by: Colcombet, Thomas, et al.
Published: (2026)

Generalized Parikh Matrices For Tracking Subsequence Occurrences
by: Fazekas, Szilárd Zsolt, et al.
Published: (2024)

On Transition Constructions for Automata -- A Categorical Perspective
by: Cruchten, Mike
Published: (2024)

Input-Erasing Two-Way Finite Automata
by: Meduna, Alexander, et al.
Published: (2025)

Axiomatizing NFAs Generated by Regular Grammars
by: Gorrieri, Roberto
Published: (2024)

Hamming distance between finite transducers
by: Dartois, Luc, et al.
Published: (2026)

Well-Quasi-Orderings on Word Languages
by: Lhote, Nathan, et al.
Published: (2025)

A Logic For Fresh Labelled Transition Systems
by: Bandukara, Mohamed H, et al.
Published: (2025)

Active Learning of Mealy Machines with Timers
by: Bruyère, Véronique, et al.
Published: (2024)

A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
by: Cho, Da-Jung, et al.
Published: (2025)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
by: Adsul, Bharat, et al.
Published: (2024)

Computing the Bandwidth of Meager Timed Automata
by: Asarin, Eugene, et al.
Published: (2024)

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
by: Heemstra, Jan, et al.
Published: (2025)

Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)

Well-quasi-ordered classes of bounded clique-width
by: Dumas, Maël, et al.
Published: (2026)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
by: Nakano, Keisuke, et al.
Published: (2024)

Anti-Context-Free languages
by: Cardó, Carles
Published: (2024)

Decision Problems on Copying and Shuffling
by: Halava, Vesa, et al.
Published: (2023)

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
by: Cojocaru, Liliana
Published: (2015)

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