Imagen de Portada

Solvability of orbit-finite systems of linear equations

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ghosh, Arka, Hofman, Piotr, Lasota, Sławomir
Formato:	Preprint
Publicado:	2022
Materias:	Computation and Language Formal Languages and Automata Theory Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Orbit-finite linear programming
por: Ghosh, Arka, et al.
Publicado: (2023)

Bi-reachability in Petri nets with data
por: Kamiński, Łukasz, et al.
Publicado: (2024)

Reachability in 3-VASS is Elementary
por: Czerwiński, Wojciech, et al.
Publicado: (2025)

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
por: Czerwiński, Wojciech, et al.
Publicado: (2022)

Equivariant ideals of polynomials
por: Ghosh, Arka, et al.
Publicado: (2024)

Function spaces for orbit-finite sets
por: Bojańczyk, Mikołaj, et al.
Publicado: (2024)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
por: Guttenberg, Roland, et al.
Publicado: (2025)

Reachability in symmetric VASS
por: Kamiński, Łukasz, et al.
Publicado: (2025)

Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic)
por: Dartois, Luc, et al.
Publicado: (2026)

A proof theory of right-linear (omega-)grammars via cyclic proofs
por: Das, Anupam, et al.
Publicado: (2024)

Cyclic system for an algebraic theory of alternating parity automata
por: Das, Anupam, et al.
Publicado: (2025)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
por: Rooduijn, Jan, et al.
Publicado: (2024)

The termination of Nielsen transformations applied to word equations with length constraints
por: Przybocki, Benjamin, et al.
Publicado: (2025)

Message complexity for unary multiautomata systems
por: Choffrut, Christian
Publicado: (2024)

The role of counting quantifiers in laminar set systems
por: Campbell, Rutger, et al.
Publicado: (2025)

Non-commutative linear logic fragments with sub-context-free complexity
por: Nishimiya, Yusaku, et al.
Publicado: (2025)

Positive First-order Logic on Words and Graphs
por: Kuperberg, Denis
Publicado: (2022)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
por: Barloy, Corentin, et al.
Publicado: (2025)

An algebraic theory of ω-regular languages, via μν-expressions
por: Das, Anupam, et al.
Publicado: (2025)

An efficient quantifier elimination procedure for Presburger arithmetic
por: Haase, Christoph, et al.
Publicado: (2024)

Positive Hennessy-Milner Logic for Branching Bisimulation
por: Geuvers, Herman, et al.
Publicado: (2022)

Existential Definability over the Subword Ordering
por: Baumann, Pascal, et al.
Publicado: (2022)

Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
por: Havlena, Vojtěch, et al.
Publicado: (2022)

Separators in Continuous Petri Nets
por: Blondin, Michael, et al.
Publicado: (2022)

A Hierarchy of Nondeterminism
por: Radi, Bader Abu, et al.
Publicado: (2022)

An Elementary Proof of the FMP for Kleene Algebra
por: Kappé, Tobias
Publicado: (2022)

On Good-for-MDPs Automata
por: Schewe, Sven, et al.
Publicado: (2022)

Characterising memory in infinite games
por: Casares, Antonio, et al.
Publicado: (2022)

Monitoring Timed Properties (Revisited)
por: Grosen, Thomas Møller, et al.
Publicado: (2022)

A Dichotomy Theorem for Automatic Structures
por: Cuvelier, Antoine, et al.
Publicado: (2026)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
por: Abdulla, Parosh Aziz, et al.
Publicado: (2024)

The Queue Automaton Revisited
por: Baeten, Jos C. M., et al.
Publicado: (2025)

Relating Reversible Petri Nets and Reversible Event Structures, categorically
por: Melgratti, Hernán, et al.
Publicado: (2023)

Simplifying LTL Model Checking Given Prior Knowledge
por: Duret-Lutz, Alexandre, et al.
Publicado: (2025)

Determinization of Min-Plus Weighted Automata is Decidable
por: Almagor, Shaull, et al.
Publicado: (2025)

Unreliability in Practical Subclasses of Communicating Systems
por: Suresh, Amrita, et al.
Publicado: (2025)

Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics
por: Di Giusto, Cinzia, et al.
Publicado: (2025)

Parameterized Verification of Quantum Circuits (Technical Report)
por: Abdulla, Parosh Aziz, et al.
Publicado: (2025)

How Concise are Chains of co-Büchi Automata?
por: Ehlers, Rüdiger
Publicado: (2026)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
por: Li, Junle, et al.
Publicado: (2025)