Cover Image

Rewriting Systems on Arbitrary Monoids

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Magalhães, Eduardo
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory Logic in Computer Science Category Theory 68Q42, 18D99, 20M05, F.4.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Anti-Context-Free languages
by: Cardó, Carles
Published: (2024)

From higher-order rewriting systems to higher-order categorial algebras and higher-order Curry-Howard isomorphisms
by: Vidal, Juan Climent, et al.
Published: (2024)

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

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)

Lindenmayer graph languages, first-order theories and expanders
by: Knapik, Teodor
Published: (2024)

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

Solutions of Word Equations over Partially Commutative Structures
by: Diekert, Volker, et al.
Published: (2016)

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
by: Cojocaru, Liliana
Published: (2015)

Well-Quasi-Orderings on Word Languages
by: Lhote, Nathan, et al.
Published: (2025)

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

Walking on Words
by: Pratt-Hartmann, Ian
Published: (2022)

High-Performance Generation of Constrained Inputs
by: Crump, Addison, et al.
Published: (2025)

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

The Generation-Recognition Asymmetry: Six Dimensions of a Fundamental Divide in Formal Language Theory
by: Peyrichou, Romain
Published: (2026)

Black-box Context-free Grammar Inference for Readable & Natural Grammars
by: Arefin, Mohammad Rifat, et al.
Published: (2025)

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

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
by: Ibarra, Oscar H., et al.
Published: (2024)

Decision Problems on Copying and Shuffling
by: Halava, Vesa, et al.
Published: (2023)

Lambek pregroups are Frobenius spiders in preorders
by: Pavlovic, Dusko
Published: (2021)

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

Parsing Hypergraphs using Context-Free Positional Grammars
by: Costagliola, Gennaro, et al.
Published: (2026)

Various Types of Comet Languages and their Application in External Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2024)

Polygraphic resolutions for operated algebras
by: Liu, Zuan, et al.
Published: (2025)

On Graph Grammars and Games
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)

Polygraphs: From Rewriting to Higher Categories
by: Ara, Dimitri, et al.
Published: (2023)

A Uniform Framework for Problems on Context-Free Grammars
by: Esparza, Javier, et al.
Published: (2024)

Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version)
by: Nishida, Naoki, et al.
Published: (2026)

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

Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (Full Version)
by: Nishida, Naoki
Published: (2026)

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)

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

Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus (Extended Version)
by: Schaefer, Steven, et al.
Published: (2025)

LR Parsing of Permutation Phrases
by: Kostičová, Jana
Published: (2024)

CBCL: Safe Self-Extending Agent Communication
by: O'Connor, Hugo
Published: (2026)

On Quantum Context-Free Grammars
by: Aruja, Merina, et al.
Published: (2025)

Identity Testing for Stochastic Languages
by: Agarwal, Smayan, et al.
Published: (2025)

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