:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Czerwiński, Wojciech, Hofman, Piotr
Format:	Preprint
Publié:	2022
Sujets:	Formal Languages and Automata Theory Logic in Computer Science
Accès en ligne:	https://arxiv.org/abs/2202.08033
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Languages of Boundedly-Ambiguous Vector Addition Systems with States
par: Czerwiński, Wojciech, et autres
Publié: (2025)

The Tractability Border of Reachability in Simple Vector Addition Systems with States
par: Chistikov, Dmitry, et autres
Publié: (2024)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
par: Guttenberg, Roland, et autres
Publié: (2025)

Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
par: Czerwiński, Wojciech, et autres
Publié: (2025)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
par: Bizière, Clotilde, et autres
Publié: (2024)

Reachability in 3-VASS is Elementary
par: Czerwiński, Wojciech, et autres
Publié: (2025)

Improving Reachability in Vector Addition Systems through Pumpability
par: Chen, Weijun, et autres
Publié: (2026)

Reachability in Vector Addition System with States Parameterized by Geometric Dimension
par: Zheng, Yangluo
Publié: (2024)

Solvability of orbit-finite systems of linear equations
par: Ghosh, Arka, et autres
Publié: (2022)

Characterization and Decidability of FC-Definable Regular Languages
par: Thompson, Sam M., et autres
Publié: (2025)

General Decidability Results for Systems with Continuous Counters
par: Balasubramanian, A. R., et autres
Publié: (2025)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
par: Barloy, Corentin, et autres
Publié: (2025)

Decidability Problems for Micro-Stipula
par: Delzanno, Giorgio, et autres
Publié: (2025)

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata
par: Jecker, Ismaël, et autres
Publié: (2023)

Determinization of Min-Plus Weighted Automata is Decidable
par: Almagor, Shaull, et autres
Publié: (2025)

Negated String Containment is Decidable (Technical Report)
par: Havlena, Vojtěch, et autres
Publié: (2025)

A Uniform Framework for Language Inclusion Problems
par: Doveri, Kyveli, et autres
Publié: (2024)

Deciding the synthesis problem for hybrid games through bisimulation
par: Dima, Catalin, et autres
Publié: (2024)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
par: Guha, Shibashis, et autres
Publié: (2026)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
par: Daviaud, Laure, et autres
Publié: (2023)

A Completeness Theorem for Probabilistic Regular Expressions
par: Różowski, Wojciech, et autres
Publié: (2023)

Kofola 1.0: A Modular Approach to ω-Regular Complementation and Inclusion Checking (Technical Report)
par: Alexaj, Ondrej, et autres
Publié: (2026)

PVASS Reachability is Decidable
par: Guttenberg, Roland, et autres
Publié: (2025)

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
par: Bueri, Lucas, et autres
Publié: (2024)

Weighted GKAT: Completeness and Complexity
par: Van Koevering, Spencer, et autres
Publié: (2025)

Deciding Serializability in Network Systems
par: Amir, Guy, et autres
Publié: (2026)

A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes
par: Różowski, Wojciech, et autres
Publié: (2026)

Logic and Languages of Higher-Dimensional Automata
par: Amrane, Amazigh, et autres
Publié: (2024)

Unreliability in Practical Subclasses of Communicating Systems
par: Suresh, Amrita, et autres
Publié: (2025)

Algebraic Characterizations of Classes of Regular Languages in DynFO
par: Barloy, Corentin, et autres
Publié: (2026)

Random Graph Generation in Context-Free Graph Languages
par: Vastarini, Federico, et autres
Publié: (2024)

A Session Type System for Asynchronous Unreliable Broadcast Communication
par: Kouzapas, Dimitrios, et autres
Publié: (2019)

Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
par: Mandrioli, Dino, et autres
Publié: (2020)

A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
par: Tsai, Wei-Lun, et autres
Publié: (2026)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
par: Aceto, Luca, et autres
Publié: (2025)

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
par: Li, Shuo, et autres
Publié: (2023)

Uncertainty Removal in Verification of Nonlinear Systems against Signal Temporal Logic via Incremental Reachability Analysis
par: Besset, Antoine, et autres
Publié: (2025)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
par: Li, Junle, et autres
Publié: (2025)

Positive First-order Logic on Words and Graphs
par: Kuperberg, Denis
Publié: (2022)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
par: Rooduijn, Jan, et autres
Publié: (2024)