:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Ambroszkiewicz, Stanislaw, Bartyna, Waldemar, Bylka, Stanislaw
Formato:	Preprint
Publicado:	2021
Materias:	Computation and Language Logic in Computer Science 68M14 F.4.3; F.1.1
Acceso en línea:	https://arxiv.org/abs/2105.10362
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A simple protocol to automate the executing, scaling, and reconfiguration of Cloud-Native Apps
por: Ambroszkiewicz, Stanislaw, et al.
Publicado: (2023)

Commutative N-polyregular functions
por: Lopez, Aliaume
Publicado: (2024)

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

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

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

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

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

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)

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

Graded Monads in the Semantics of Nominal Automata
por: Schulze, Hannes, et al.
Publicado: (2025)

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

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

Regular Model Checking for Systems with Effectively Regular Reachability Relation
por: Esparza, Javier, et al.
Publicado: (2025)

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

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

Recursive windows for grammar logics of bounded density
por: Gasquet, Olivier
Publicado: (2025)

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

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

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

On the existence of strong proof complexity generators
por: Krajicek, Jan
Publicado: (2022)

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)

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)

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

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

Decidable Reversible Equivalences for Finite Petri Nets
por: Gorrieri, Roberto, et al.
Publicado: (2025)

Compositional Separation of Control Flow and Data Flow
por: Arellanes, Damian
Publicado: (2023)

Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
por: Lopez, Aliaume
Publicado: (2024)

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
por: Schewe, Klaus-Dieter
Publicado: (2020)

The Maude strategy language
por: Eker, Steven, et al.
Publicado: (2024)

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

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

Mechanizing Operads with Event-B
por: Attiogbé, Christian
Publicado: (2025)

Weighing Obese Timed Languages
por: Asarin, Eugene, et al.
Publicado: (2025)

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