String rewriting for double coset systems.

DOI10.1016/j.jsc.2005.10.004zbMath1126.20022arXivmath/0508391OpenAlexW2102315771MaRDI QIDQ2457349

Neil Ghani, Anne Heyworth, Ronald Brown, Christopher D. Wensley

Publication date: 23 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0508391

zbMATH Keywords

double cosetsmonoid presentationsregular languagesstring rewritingfree monoidsleft Kan extensionsKnuth-Bendix procedureinduced actionsgenerators of subgroups

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

On properties not inherited by monoids from their Schützenberger groups. ⋮ kan

Uses Software

• GAP
• automata
• AUTOMATA

Cites Work

• Double coset enumeration
• Using rewriting systems to compute left Kan extensions and induced actions of categories
• On Orbit Closures of Symmetric Subgroups in Flag Varieties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item