Some problems on groups of finite automatic permutations

MaRDI QIDQ1605565zbMATH OpenFDO

Authors Volodymyr Nekrashevych, V. Sushchansky

Publication date 21 July 2002

Published in Matematychni Studiï (Search for Journal in Brave)

zbMATH Keywords

automataautomatic permutationsfinite alphabetsfree monoidsgroups

Mathematics Subject Classification ID

Infinite automorphism groups (20B27) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• scientific article; zbMATH DE number 1376752
• scientific article; zbMATH DE number 1537527
• scientific article; zbMATH DE number 1166283
• Systems of generators of automaton permutations groups
• scientific article; zbMATH DE number 1376768

Cited in

(12)

• Permutive one-way cellular automata and the finiteness problem for automaton groups
• On the membership problem for finite automata over symmetric groups
• Free products of finite groups and groups of finitely automatic permutations
• On automatic infinite permutations
• On straight words and minimal permutators in finite transformation semigroups
• The permutation rank of an automaton i
• scientific article; zbMATH DE number 17922 (Why is no real title available?)
• scientific article; zbMATH DE number 599365 (Why is no real title available?)
• scientific article; zbMATH DE number 1166283 (Why is no real title available?)
• The automaton permutation group AS n is generated by elements of infinite order
• scientific article; zbMATH DE number 1376752 (Why is no real title available?)
• scientific article; zbMATH DE number 1857725 (Why is no real title available?)

This page was built for publication: Some problems on groups of finite automatic permutations

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