Cover Image

Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Lopez, Aliaume
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science 68Q45, 03B70, 03D05 F.4.3; F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
by: Bruse, Florian, et al.
Published: (2026)

Recursive windows for grammar logics of bounded density
by: Gasquet, Olivier
Published: (2025)

PSPACE-completeness of bimodal transitive weak-density logic
by: Balbiani, Philippe, et al.
Published: (2025)

Stratifiable formulae are not context-free
by: Ryan-Smith, Calliope
Published: (2023)

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)

Gödel Mirror: A Formal System For Contradiction-Driven Recursion
by: Chan, Jhet
Published: (2025)

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

A correspondence between the time and space complexity
by: Latkin, Ivan V.
Published: (2023)

Commutative N-polyregular functions
by: Lopez, Aliaume
Published: (2024)

Relational Connectors and Heterogeneous Bisimulations
by: Nora, Pedro, et al.
Published: (2024)

Computing Distinguishing Formulae for Threshold-Based Behavioural Distances
by: Forster, Jonas, et al.
Published: (2026)

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

A declarative approach to specifying distributed algorithms using three-valued modal logic
by: Gabbay, Murdoch J., et al.
Published: (2025)

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

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

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

A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
by: Ramos, Arthur, et al.
Published: (2025)

Behavioural Conformances based on Lax Couplings
by: Wild, Paul, et al.
Published: (2025)

Quantitative Graded Semantics and Spectra of Behavioural Metrics
by: Forster, Jonas, et al.
Published: (2023)

Nominal techniques as an Agda library
by: Gabbay, Murdoch J., et al.
Published: (2026)

Generalized Kantorovich-Rubinstein Duality beyond Hausdorff and Kantorovich
by: Wild, Paul, et al.
Published: (2025)

Solutions of Word Equations over Partially Commutative Structures
by: Diekert, Volker, et al.
Published: (2016)

Dismantling the Surprise Test "Paradox"
by: Dietzfelbinger, Martin
Published: (2026)

First-Order Coalition Logic
by: Catta, Davide, et al.
Published: (2025)

Mechanised uniform interpolation for modal logics K, GL, and iSL
by: Férée, Hugo, et al.
Published: (2024)

Continuous and algebraic domains in univalent foundations
by: de Jong, Tom, et al.
Published: (2024)

Run supports and initial algebra supports of weighted automata
by: Droste, Manfred, et al.
Published: (2024)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
by: Rahnama, Moses
Published: (2025)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

Sheaves as oracle computations
by: Ahman, Danel, et al.
Published: (2026)

On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
by: Bacik, Piotr, et al.
Published: (2026)

Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)

The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)

Word equations and the exponent of periodicity
by: Diekert, Volker, et al.
Published: (2025)

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

Encoding argumentation frameworks with set attackers to propositional logic systems
by: Tang, Shuai, et al.
Published: (2025)

Encoding higher-order argumentation frameworks with supports to propositional logic systems
by: Tang, Shuai
Published: (2025)

Arithmetics within the Linear Time Hierarchy
by: Pollett, Chris
Published: (2025)