Cover Image

Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Egri-Nagy, Attila
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory 20M20, 20M35
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computational Exploration of Finite Semigroupoids
by: Egri-Nagy, Attila, et al.
Published: (2025)

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

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

Pseudovarieties of semigroups
by: Almeida, Jorge
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Algebraic Characterization of FO-definable Languages of Higher-Dimensional Automata
by: Erlich, Enzo, et al.
Published: (2026)

Subsets of groups with context-free preimages
by: Levine, Alex
Published: (2023)

The word problem and growth of groups
by: Bondarenko, Ievgen
Published: (2024)

State Complexity of Multiple Concatenation
by: Jirásek, Jozef, et al.
Published: (2025)

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

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

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

Rewriting Systems on Arbitrary Monoids
by: Magalhães, Eduardo
Published: (2026)

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

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

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

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