Imagen de Portada

Orbit-finite linear programming

Fuente: arXiv

Guardado en:

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

Ejemplares similares

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

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

Characterizing NC1 with Typed Monoids
por: Dawar, Anuj, et al.
Publicado: (2025)

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

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

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

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

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

Lexicographic transductions of finite words
por: Filiot, Emmanuel, et al.
Publicado: (2025)

Introducing Divergence for Infinite Probabilistic Models
por: Finkel, Alain, et al.
Publicado: (2023)

Openness And Partial Adjacency In One Variable TPTL
por: Krishna, Shankara Narayanan, et al.
Publicado: (2024)

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

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

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

Recognizing Numbers
por: Gaba, Pranshu, et al.
Publicado: (2025)

Probabilistic Finite Automaton Emptiness is undecidable
por: Rote, Günter
Publicado: (2024)

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

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

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

On Some Complexity Results for Even Linear Languages
por: Cojocaru, Liliana
Publicado: (2024)

Identity Testing for Stochastic Languages
por: Agarwal, Smayan, et al.
Publicado: (2025)

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

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

A LOCAL View of the Polynomial Hierarchy
por: Reiter, Fabian
Publicado: (2023)

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

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
por: Grabmayer, Clemens
Publicado: (2024)

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

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

Inquisitive Team Semantics of LTL
por: Bozzelli, Laura, et al.
Publicado: (2025)

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

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
por: Lin, Deren, et al.
Publicado: (2014)

Exploring Complexity: An Extended Study of Formal Properties for Process Model Complexity Measures
por: Schalk, Patrizia, et al.
Publicado: (2024)

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

Stratifiable formulae are not context-free
por: Ryan-Smith, Calliope
Publicado: (2023)

A Theory of Hanoi Omega-Automata and Games
por: Filiot, Emmanuel, et al.
Publicado: (2026)

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

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

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

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

The Algebra of Nondeterministic Finite Automata
por: Gorrieri, Roberto
Publicado: (2023)