Cover Image

INTERLEAVE: A Faster Symbolic Algorithm for Maximal End Component Decomposition

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bansal, Suguman, Singh, Ramneet
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Formal Languages and Automata Theory Programming Languages D.3.1; F.3.1; F.4.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
by: Bobrow, Elliot, et al.
Published: (2025)

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
by: Geatti, Luca, et al.
Published: (2024)

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

Towards Automatic Error Recovery in Parsing Expression
by: de Medeiros, Sérgio Queiroz, et al.
Published: (2025)

LR Parsing of Permutation Phrases
by: Kostičová, Jana
Published: (2024)

Non-reducible Modal Transition Systems
by: Basile, Davide
Published: (2023)

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

Quantitative Verification of Omega-regular Properties in Probabilistic Programming
by: Wang, Peixin, et al.
Published: (2025)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)

Visualising CTL Witnesses and Counterexamples -- Extended Version
by: Rensink, Arend
Published: (2026)

Probability and Angelic Nondeterminism with Multiset Semantics
by: Ong, Shawn, et al.
Published: (2024)

Scalable Learning of One-Counter Automata via State-Merging Algorithms
by: Guha, Shibashis, et al.
Published: (2025)

Model-bounded monitoring of hybrid systems
by: Waga, Masaki, et al.
Published: (2021)

Quantitative Assurance and Synthesis of Controllers from Activity Diagrams
by: Ye, Kangfeng, et al.
Published: (2024)

Thinking Like a Student: AI-Supported Reflective Planning in a Theory-Intensive Computer Science Course
by: Izsak, Noa
Published: (2025)

Quasi-stratified Order Semantics of Concurrency
by: Koutny, Maciej, et al.
Published: (2024)

Specifying and Verifying the Convergence Stairs of the Collatz Program
by: Ebnenasir, Ali
Published: (2024)

CBCL: Safe Self-Extending Agent Communication
by: O'Connor, Hugo
Published: (2026)

Flavors of Quantifiers in Hyperlogics
by: Chalupa, Marek, et al.
Published: (2025)

Generically Automating Separation Logic by Functors, Homomorphisms and Modules
by: Xu, Qiyuan, et al.
Published: (2024)

Bridging Chaos Game Representations and $k$-mer Frequencies of DNA Sequences
by: He, Haoze, et al.
Published: (2025)

Inversion by Partial Evaluation: A Reversible Interpreter Experiment
by: Glück, Robert, et al.
Published: (2024)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
by: Esparza, Javier, et al.
Published: (2025)

Learn, Check, Test -- Security Testing Using Automata Learning and Model Checking
by: Marksteiner, Stefan, et al.
Published: (2025)

Derivative-Guided Symbolic Execution
by: Yuan, Yongwei, et al.
Published: (2024)

Verified VCG and Verified Compiler for Dafny
by: Nezamabadi, Daniel, et al.
Published: (2025)

Characterizing NC1 with Typed Monoids
by: Dawar, Anuj, et al.
Published: (2025)

Difficulty Generating Factors for Context-free Language Construction Assignments
by: Schmalstieg, Florian, et al.
Published: (2025)

Unified Fairness for Weak Memory Verification
by: Abdulla, Parosh Aziz, et al.
Published: (2023)

A HAT Trick: Automatically Verifying Representation Invariants Using Symbolic Finite Automata
by: Zhou, Zhe, et al.
Published: (2024)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
by: Basold, Henning, et al.
Published: (2023)

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

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
by: Ong, Shawn, et al.
Published: (2025)

Orbit-finite linear programming
by: Ghosh, Arka, et al.
Published: (2023)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
by: Grabolle, Gustav
Published: (2022)

Effect-Transparent Governance for AI Workflow Architectures: Semantic Preservation, Expressive Minimality, and Decidability Boundaries
by: McCann, Alan L.
Published: (2026)

Algebraic Semantics of Governed Execution: Monoidal Categories, Effect Algebras, and Coterminous Boundaries
by: McCann, Alan L.
Published: (2026)

Explicit Weakening
by: Wadler, Philip
Published: (2024)

Genericity Through Stratification
by: Arrial, Victor, et al.
Published: (2024)

AdapTT: Functoriality for Dependent Type Casts
by: Adjedj, Arthur, et al.
Published: (2025)