:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Ambroszkiewicz, Stanislaw, Bartyna, Waldemar, Bylka, Stanislaw
Format:	Preprint
Published:	2021
Subjects:	Computation and Language Logic in Computer Science 68M14 F.4.3; F.1.1
Online Access:	https://arxiv.org/abs/2105.10362
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)

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

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

Orbit-finite linear programming
by: Ghosh, Arka, et al.
Published: (2023)

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

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

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

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

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

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

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

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

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

A LOCAL View of the Polynomial Hierarchy
by: Reiter, Fabian
Published: (2023)

Characterizing NC1 with Typed Monoids
by: Dawar, Anuj, et al.
Published: (2025)

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)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)

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

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

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

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

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

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

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

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

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

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

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

Compositional Separation of Control Flow and Data Flow
by: Arellanes, Damian
Published: (2023)

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

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

The Maude strategy language
by: Eker, Steven, et al.
Published: (2024)

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

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

Mechanizing Operads with Event-B
by: Attiogbé, Christian
Published: (2025)

Weighing Obese Timed Languages
by: Asarin, Eugene, et al.
Published: (2025)

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