与除shortlex以外的词序相关联的自动组
Automatic groups associated with word orders other than shortlex
摘要：
现有的算法来计算和验证自动机与自动组处理的子类shortlex自动组。本文描述了该算法的扩展，以处理与其他词序相关联的自动组（该算法现在已经实现），并报告了该算法在具体示例中的使用;特别是非常自然自动变速器（000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000与Epstein等人对这些组中的某些组所描述的一个密切相关的是从对shortlex的圈积阶中发现的。
英文摘要：
The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups associated with other word orders (the algorithm has now been implemented ) and reports on the use of the algorithm for specific examples; in particular a very natural automatic (or asynchonously automatic) structure for the Baumslag-Solitar and related classes of groups (closely related to one described for some of those groups by Epstein et al. is found from a wreath product order over shortlex.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
