Imagen de Portada

Computational Exploration of Finite Semigroupoids

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Egri-Nagy, Attila, Nehaniv, Chrystopher L.
Formato:	Preprint
Publicado:	2025
Materias:	Formal Languages and Automata Theory 20M20, 20M35
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Measuring the Computational Power of Finite Patches of Cellular Automata
por: Egri-Nagy, Attila, et al.
Publicado: (2026)

The Attractor-Cycle Notation for Finite Transformations
por: Egri-Nagy, Attila, et al.
Publicado: (2013)

Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages
por: Egri-Nagy, Attila
Publicado: (2025)

From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
por: Egri-Nagy, Attila, et al.
Publicado: (2024)

Representation Independent Decompositions of Computation
por: Egri-Nagy, Attila, et al.
Publicado: (2025)

On Constructing Finite Automata by Relational Programming
por: Egri-Nagy, Attila, et al.
Publicado: (2025)

Skeleton Key: Subduction Classes in Finite Transformation Semigroups and Green's Relations
por: Egri-Nagy, Attila, et al.
Publicado: (2014)

Pseudovarieties of semigroups
por: Almeida, Jorge
Publicado: (2025)

A short proof of a bound on the size of finite irreducible semigroups of rational matrices
por: Steinberg, Benjamin
Publicado: (2026)

Preserving self-similarity in free products of semigroups
por: Brough, Tara Macalister, et al.
Publicado: (2020)

The Word Problem for $(ω- 1)$-Terms over $\mathrm{DAb}$
por: Almeida, Jorge, et al.
Publicado: (2024)

Factoring through monomial representations: arithmetic characterizations and ambiguity of weighted automata
por: Puch, Antoni, et al.
Publicado: (2024)

Topoi of automata I: Four topoi of automata and regular languages
por: Hora, Ryuya
Publicado: (2024)

Kunz languages for numerical semigroups are context sensitive
por: Delgado, Manuel, et al.
Publicado: (2023)

Simplicity and irreducibility in circular automata
por: Venturi, Riccardo
Publicado: (2025)

Computing Embeddings and Isomorphisms of Finite Semigroups
por: East, James, et al.
Publicado: (2016)

The Freeness Problem for Automaton Semigroups
por: D'Angeli, Daniele, et al.
Publicado: (2024)

Generalizations of the Muller-Schupp theorem and tree-like inverse graphs
por: Rodaro, Emanuele
Publicado: (2023)

The hereditariness problem for the Černý conjecture
por: Rodaro, Emanuele, et al.
Publicado: (2025)

Uniform winning strategies for the synchronization games on subclasses of finite automata
por: Fernau, Henning, et al.
Publicado: (2025)

On groups with EDT0L word problem
por: Bishop, Alex, et al.
Publicado: (2025)

Rational cross-sections, bounded generation and orders on groups
por: Bodart, Corentin
Publicado: (2022)

Complexity of Finite Semigroups: History and Decidability
por: Margolis, StuarT, et al.
Publicado: (2025)

Aperiodic Flows on Finite Semigroups II: Smallish Monoids Suffice for Complexity 1
por: Margolis, Stuart, et al.
Publicado: (2026)

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

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

Free inverse monoids are co-context-free
por: Brough, Tara Macalister, et al.
Publicado: (2025)

Aperiodic Flows on Finite Semigroups: Foundations and First Examples
por: Margolis, Stuart, et al.
Publicado: (2024)

Preprint: Exploring Inevitable Waypoints for Unsolvability Explanation in Hybrid Planning Problems
por: Sarwar, Mir Md Sajid, et al.
Publicado: (2025)

5' -> 3' Watson-Crick Automata accepting Necklaces
por: Nagy, Benedek
Publicado: (2024)

Master List of Examples in Complexity Theory of Finite Semigroup Theory
por: Margolis, Stuart, et al.
Publicado: (2025)

Subsets of groups with context-free preimages
por: Levine, Alex
Publicado: (2023)

The word problem and growth of groups
por: Bondarenko, Ievgen
Publicado: (2024)

Decidability of Krohn-Rhodes complexity for all finite semigroups and automata
por: Margolis, Stuart, et al.
Publicado: (2024)

Program Analysis via Multiple Context Free Language Reachability
por: Conrado, Giovanna Kobus, et al.
Publicado: (2024)

Rewriting Systems on Arbitrary Monoids
por: Magalhães, Eduardo
Publicado: (2026)

The algebra of binary trees is affine complete
por: Arnold, Andre, et al.
Publicado: (2020)

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

Context-free graphs and their transition groups
por: D'Angeli, Daniele, et al.
Publicado: (2024)

Approximate Problems for Finite Transducers
por: Filiot, Emmanuel, et al.
Publicado: (2025)