Commutative semigroups with a context-free word problem
From MaRDI portal
Cites work
- A language hierarchy of binary relations
- A short proof of Rédei's theorem
- Closure properties in the class of multiple context-free groups
- Context-Free Groups and Bass–Serre Theory
- Context-free groups and their structure trees.
- Context-free word problem semigroups
- Developments in Language Theory
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- Groups with poly-context-free word problem.
- Groups, languages and automata
- Groups, the theory of ends, and context-free languages
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 53545 (Why is no real title available?)
- scientific article; zbMATH DE number 1033559 (Why is no real title available?)
- scientific article; zbMATH DE number 1438385 (Why is no real title available?)
- scientific article; zbMATH DE number 3216273 (Why is no real title available?)
- scientific article; zbMATH DE number 3381862 (Why is no real title available?)
- Logical aspects of Cayley-graphs: the group case
- MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies
- Non-finitely generated maximal subgroups of context-free monoids
- On a subclass of context-free groups
- On Cayley graphs of virtually free groups.
- On Context-Free Languages
- ON GROUPS AND COUNTER AUTOMATA
- On the word problem for free products of semigroups and monoids
- On the word problem for special monoids
- Semigroups with a Context-Free Word Problem
- Space complexity and word problems of groups
- The accessibility of finitely presented groups
- Word hyperbolic semigroups
- Word problem languages for free inverse monoids
- Word problems recognisable by deterministic blind monoid automata
This page was built for publication: Commutative semigroups with a context-free word problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987054)
