The following pages link to (Q4846257):
Displaying 50 items.
- On termination of confluent one-rule string-rewriting systems (Q286976) (← links)
- Decision problems for word-hyperbolic semigroups (Q306545) (← links)
- Ends of semigroups (Q343474) (← links)
- On finite complete rewriting systems and large subsemigroups. (Q408518) (← links)
- The derivational complexity of string rewriting systems (Q441853) (← links)
- Higher-dimensional normalisation strategies for acyclicity (Q456807) (← links)
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. (Q479731) (← links)
- Hopfian and co-Hopfian subsemigroups and extensions. (Q488818) (← links)
- A saturation method for the modal \(\mu \)-calculus over pushdown systems (Q532393) (← links)
- On properties not inherited by monoids from their Schützenberger groups. (Q549674) (← links)
- Leaf languages and string compression (Q550251) (← links)
- Bounded hairpin completion (Q553314) (← links)
- Fixed points of endomorphisms over special confluent rewriting systems. (Q604812) (← links)
- Computing by observing: simple systems and simple observers (Q616498) (← links)
- Finite complete rewriting systems for regular semigroups. (Q627163) (← links)
- The Knuth-Bendix algorithm and the conjugacy problem in monoids. (Q633198) (← links)
- Generators and relations for subsemigroups via boundaries in Cayley graphs. (Q640935) (← links)
- The next step of the word problem over monoids. (Q648197) (← links)
- Homological finiteness properties of monoids, their ideals and maximal subgroups. (Q649868) (← links)
- A finitely presented monoid which has solvable word problem but has no regular complete presentation (Q673144) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- Deleting string rewriting systems preserve regularity (Q703575) (← links)
- Two-dimensional comma-free and cylindric codes (Q728259) (← links)
- On complete one-way functions (Q734307) (← links)
- Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\) (Q844184) (← links)
- A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems (Q844899) (← links)
- Termination proofs for string rewriting systems via inverse match-bounds (Q851146) (← links)
- A geometric characterization of automatic semigroups (Q861269) (← links)
- On the rational subset problem for groups. (Q875109) (← links)
- A survey on the local divisor technique (Q896673) (← links)
- An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
- Infinite periodic points of endomorphisms over special confluent rewriting systems (Q1013030) (← links)
- Rewriting systems in alternating knot groups with the Dehn presentation (Q1014923) (← links)
- Rational subsets of polycyclic monoids and valence automata (Q1041050) (← links)
- On the descriptive power of special Thue systems (Q1126309) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- Compositions with superlinear deterministic top-down tree transformations (Q1127541) (← links)
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- Contributions of Ronald V. Book to the theory of string-rewriting systems (Q1274982) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- Synchronization expressions with extended join operation (Q1274985) (← links)
- Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings (Q1275014) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- The finiteness of finitely presented monoids (Q1275467) (← links)
- Homotopy reduction systems for monoid presentations (Q1295568) (← links)
- A finiteness condition for rewriting systems (Q1331943) (← links)
- Codes modulo finite monadic string-rewriting systems (Q1341747) (← links)
- Constructing finitely presented monoids which have no finite complete presentation (Q1357103) (← links)
