Cover Image

Regular Model Checking for Systems with Effectively Regular Reachability Relation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Esparza, Javier, Krasotin, Valentin
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory Computational Complexity 68Q45 F.4.3; F.1.1; F.1.3; F.3.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computing Inductive Invariants of Regular Abstraction Frameworks
by: Czerner, Philipp, et al.
Published: (2024)

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

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

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

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

Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
by: Dörfler, Julian, et al.
Published: (2024)

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

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

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

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
by: Diekert, Volker, et al.
Published: (2019)

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
by: Pighizzini, Giovanni
Published: (2026)

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

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

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

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

Weighing Obese Timed Languages
by: Asarin, Eugene, et al.
Published: (2025)

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

Evolution-Based Timed Opacity under a Universal Observation Model
by: Zhang, Zhe, et al.
Published: (2026)

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

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

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

Recognizing Numbers
by: Gaba, Pranshu, et al.
Published: (2025)

Lexicographic transductions of finite words
by: Filiot, Emmanuel, et al.
Published: (2025)

Probabilistic Finite Automaton Emptiness is undecidable
by: Rote, Günter
Published: (2024)

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

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
by: Rote, Günter
Published: (2024)

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

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
by: Silva, Jorge Miguel
Published: (2026)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
by: Lopez, Aliaume
Published: (2024)

Identity Testing for Stochastic Languages
by: Agarwal, Smayan, et al.
Published: (2025)

Regular Expressions with Backreferences: Polynomial-Time Matching Techniques
by: Schmid, Markus L.
Published: (2019)

Programmable Co-Transcriptional Splicing: Realizing Regular Languages via Hairpin Deletion
by: Cho, Da-Jung, et al.
Published: (2025)

A Myhill-Nerode Type Characterization of 2detLIN Languages
by: Nagy, Benedek
Published: (2025)

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

On some Classes of Reversible 2-head Automata
by: Nagy, Benedek, et al.
Published: (2025)

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

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

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

The decidability of the genus of regular languages and directed emulators
by: Bonfante, Guillaume, et al.
Published: (2021)

Subshifts defined by nondeterministic and alternating plane-walking automata
by: de Menibus, Benjamin Hellouin, et al.
Published: (2024)