On s-regular prefix-rewriting systems and automatic structures

DOI10.1007/3-540-48686-0_42MaRDI QIDQ4938677zbMATH OpenFDO

Authors Friedrich Otto

Publication date 23 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48686-0_42

zbMATH Keywords

prefix-rewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS
• scientific article; zbMATH DE number 1502107
• scientific article; zbMATH DE number 1740168
• On the regular structure of prefix rewriting
• scientific article; zbMATH DE number 789389

Cited in

(11)

• Automatic semigroups
• Geometry of the word problem for 3-manifold groups
• Autostackability of Thompson's group \(F\)
• Automatic structures for semigroup constructions.
• Uniform decision problems for automatic semigroups.
• MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS
• On the regular structure of prefix rewriting
• Algorithms and topology of Cayley graphs for groups.
• scientific article; zbMATH DE number 1254101 (Why is no real title available?)
• scientific article; zbMATH DE number 1740168 (Why is no real title available?)
• Automatic structure for generalized Bruck-Reilly \(*\)-extension of a monoid

This page was built for publication: On s-regular prefix-rewriting systems and automatic structures

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