Cover Image

Explicit Hopcroft's Trick in Categorical Partition Refinement

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sanada, Takahiro, Kojima, Ryota, Komorida, Yuichi, Muroya, Koko, Hasuo, Ichiro
Format:	Preprint
Published:	2023
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Variety of Request-Response Specifications
by: Aiba, Daichi, et al.
Published: (2025)

Parametric Timed Pattern Matching
by: Waga, Masaki, et al.
Published: (2019)

Chance and Mass Interpretations of Probabilities in Markov Decision Processes (Extended Version)
by: Tsai, Yun Chen, et al.
Published: (2025)

Componentwise Automata Learning for System Integration (Extended Version)
by: Fujinami, Hiroya, et al.
Published: (2025)

Learning Weighted Finite Automata over the Max-Plus Semiring and its Termination
by: Okudono, Takamasa, et al.
Published: (2024)

Learning Weighted Automata over Number Rings, Concretely and Categorically
by: Aristote, Quentin, et al.
Published: (2025)

Structural Abstraction and Refinement for Probabilistic Programs
by: Li, Guanyan, et al.
Published: (2025)

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$-Partitions
by: Podolskii, Vladimir, et al.
Published: (2024)

A Detailed Account of Compositional Automata Learning through Alphabet Refinement
by: Henry, Leo, et al.
Published: (2025)

The Expansion Problem for Infinite Trees
by: Blumensath, Achim
Published: (2023)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
by: Chocholatý, David, et al.
Published: (2023)

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

On the Expressive Power of Regular Expressions with Backreferences
by: Nogami, Taisei, et al.
Published: (2023)

Safety and Liveness of Quantitative Properties and Automata
by: Boker, Udi, et al.
Published: (2023)

Note on dissecting power of regular languages
by: Rukavicka, Josef
Published: (2023)

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

Checking History-Determinism is NP-hard for Parity Automata
by: Prakash, Keya
Published: (2023)

Closure Properties of General Grammars -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2023)

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

Reset thresholds of transformation monoids
by: Rystsov, Igor, et al.
Published: (2023)

Closure and Decision Properties for Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2023)

Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers
by: Gallot, Paul, et al.
Published: (2023)

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

Black-box Testing Liveness Properties of Partially Observable Stochastic Systems
by: Esparza, Javier, et al.
Published: (2023)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
by: Maneth, Sebastian, et al.
Published: (2023)

Adding Reconfiguration to Zielonka's Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2023)

On Decidability and Expressive Power of Fusion Grammars
by: Pshenitsyn, Tikhon
Published: (2023)

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
by: Akshay, S, et al.
Published: (2023)

Invariants and Home Spaces in Transition Systems and Petri Nets
by: Memmi, Gerard
Published: (2023)

Descriptional Complexity of Finite Automata -- Selected Highlights
by: Salomaa, Arto, et al.
Published: (2023)

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

A Usage-Aware Sequent Calculus for Differential Dynamic Logic
by: Dotzel, Myra, et al.
Published: (2023)

Completeness Theorems for Kleene algebra with tests and top
by: Pous, Damien, et al.
Published: (2023)

Separability and Non-Determinizability of WSTS
by: Czerwiński, Wojciech, et al.
Published: (2023)

WEX: Formal Specifications for Windows in Stream Processing
by: Hitarth, S, et al.
Published: (2022)

A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)

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

Statistical process discovery
by: Cry, Pierre, et al.
Published: (2025)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
by: Jeppson, Joshua, et al.
Published: (2025)

Hyper pattern matching
by: Waga, Masaki, et al.
Published: (2025)