scientific article; zbMATH DE number 1254101

MaRDI QIDQ4227129zbMATH OpenFDO

Authors John F. P. Hudson

Publication date 31 May 1999

zbMATH Keywords

automatic structuresbraid groupsregular rewrite systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Braid groups; Artin groups (20F36) Grammars and rewriting systems (68Q42) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• scientific article; zbMATH DE number 794243
• Publication:4938677
• scientific article; zbMATH DE number 193524
• Regularity and context-freeness over word rewriting systems
• On the regular structure of prefix rewriting
• scientific article; zbMATH DE number 125883
• An abstract formulation for rewrite systems
• Synthesis for Structure Rewriting Systems
• scientific article; zbMATH DE number 4088915

Cited in

(17)

• Word Matrix Rewriting Systems
• Automatic structure for generalized Bruck-Reilly \(*\)-extension of a monoid
• Finite transducers for divisibility monoids
• Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions.
• scientific article; zbMATH DE number 2090069 (Why is no real title available?)
• Automatic semigroups and categories.
• Automatic Presentations for Cancellative Semigroups
• Rewrite Closure and CF Hedge Automata
• Automaticity of one-relator semigroups with length less than or equal to three
• Automatic semigroups
• FA-presentable groups and rings
• Automatic presentations for semigroups.
• Normal Forms for Basis-Conjugating Automorphisms of a Free Group
• Quasi-automatic semigroups
• A geometric characterization of automatic semigroups
• Uniform decision problems for automatic semigroups.
• Notions of hyperbolicity in monoids.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227129)