On the word problem for weakly compressible monoids
From MaRDI portal
Publication:6094257
DOI10.1080/00927872.2023.2215879arXiv2012.01402MaRDI QIDQ6094257
Publication date: 10 October 2023
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.01402
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Groups, the theory of ends, and context-free languages
- Hierarchies of hyper-AFLs
- The accessibility of finitely presented groups
- Monadic Thue systems
- On monoids presented by a single relation
- Das Identitätsproblem für Gruppen mit einer definierenden Relation
- Finite homotopy bases of one-relator monoids
- The word problem for one-relation monoids: a survey
- A Lyndon's identity theorem for one-relator monoids
- On the word problem for special monoids
- Context-free word problem semigroups
- On the word problem for free products of semigroups and monoids
- Semigroups with a Context-Free Word Problem
- ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER
- ON THE WORD AND DIVISIBILITY PROBLEMS IN SEMIGROUPS WITH A SINGLE DEFINING RELATION
- Word hyperbolic semigroups
- Semigroup and Group Presentations
- Recursive Unsolvability of a problem of Thue
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS
- Indexed Grammars—An Extension of Context-Free Grammars
- Full AFLs and nested iterated substitution
- A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free