String rewriting for double coset systems.

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

Ronald Brown, Neil Ghani, Anne Heyworth, 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 cosets; monoid presentations; regular languages; string rewriting; free monoids; left Kan extensions; Knuth-Bendix procedure; induced actions; generators of subgroups

Mathematics Subject Classification ID

20F05: Generators, relations, and presentations of groups

20M05: Free semigroups, generators and relations, word problems

20M35: Semigroups in automata theory, linguistics, etc.

68Q42: Grammars and rewriting systems

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

Related Items

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

Uses Software

• GAP
• automata
• AUTOMATA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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