Cover Image

On the topology of concurrent systems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Faustino, Catarina, Kahl, Thomas, Lopes, Rodrigo
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory Logic in Computer Science Algebraic Topology 55U10, 68Q85, 05E45
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
by: Hendel, Russell Jay
Published: (2025)

Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)

Mahler equations for Zeckendorf numeration
by: Carton, Olivier, et al.
Published: (2024)

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

Hexagonal Picture Scanning Automata
by: D, Deepalakshmi, et al.
Published: (2025)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
by: Deng, Zhibo, et al.
Published: (2025)

Towards a theory of natural directed paths
by: Gaucher, Philippe
Published: (2023)

A hierarchy of reversible finite automata
by: Radionova, Maria, et al.
Published: (2024)

On Computational Completeness of Semi-Conditional Matrix Grammars
by: Fernau, Henning, et al.
Published: (2024)

Nondeterministic tree-walking automata are not closed under complementation
by: Martynova, Olga, et al.
Published: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
by: Petrov, Semyon, et al.
Published: (2024)

Mostowski Index via extended register games
by: Idir, Olivier, et al.
Published: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
by: Laumen, Jasper, et al.
Published: (2026)

From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
by: Martynova, Olga, et al.
Published: (2025)

Bounded Languages Described by GF(2)-grammars
by: Makarov, Vladislav
Published: (2019)

Linear equations and recursively enumerable sets
by: Honkala, Juha
Published: (2024)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
by: Zhu, Yinfeng
Published: (2024)

Around Don's conjecture for binary completely reachable automata
by: Zhu, Yinfeng
Published: (2024)

Don's conjecture for binary completely reachable automata: an approach and its limitations
by: Casas, David, et al.
Published: (2023)

Strong discrete Morse theory
by: Fernández, Ximena L.
Published: (2025)

Probabilistic automatic complexity of finite strings
by: Gill, Kenneth
Published: (2024)

Bandwidth of Nondeterministic Finite Automata
by: Cho, Da-Jung, et al.
Published: (2026)

Semidirect Product Decompositions for Periodic Regular Languages
by: Inoue, Yusuke, et al.
Published: (2024)

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
by: Casares, Antonio, et al.
Published: (2023)

Rational Homotopy Equivalence
by: Šimková, Mária
Published: (2025)

On the ET0L subgroup membership problem in bounded automata groups
by: Bishop, Alex, et al.
Published: (2024)

Presheaf automata
by: Struth, Georg, et al.
Published: (2024)

A generalization of Deterministic Finite Automata related to discharging
by: Campbell, John M.
Published: (2025)

A substitution lemma for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)

Natural homotopy of multipointed d-spaces
by: Gaucher, Philippe
Published: (2024)

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

The memory of $ω$-regular and BC($Σ_2^0$) objectives
by: Casares, Antonio, et al.
Published: (2025)

Layered automata: A canonical model for automata over infinite words
by: Casares, Antonio, et al.
Published: (2026)

The Complexity of Simplifying $ω$-Automata through the Alternating Cycle Decomposition
by: Casares, Antonio, et al.
Published: (2024)

Transition-based vs stated-based acceptance for automata over infinite words
by: Casares, Antonio
Published: (2025)

Implicit automata in λ-calculi III: affine planar string-to-string functions
by: Pradic, Cécilia, et al.
Published: (2024)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
by: Couvreur, Jean-Michel, et al.
Published: (2025)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
by: Yordzhev, Krasimir
Published: (2026)

Simplicity and irreducibility in circular automata
by: Venturi, Riccardo
Published: (2025)

Permutation closure for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)