Automata with restricted memory and shift endomorphisms

MaRDI QIDQ2754789zbMATH OpenFDO

Authors Volodymyr Nekrashevych, V. Sushchansky

Publication date 4 November 2001

Published in Dopovidi Natsional'noï Akademiï Nauk Ukraïny. Matematyka, Pryrodoznavstvo, Tekhnichni Nauky (Search for Journal in Brave)

zbMATH Keywords

automataresidually finite semigroupssemigroups of transformationsfree subgroupsautomaton transformationsshift endomorphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• scientific article; zbMATH DE number 1857725
• On free semigroups of automaton transformations
• scientific article; zbMATH DE number 1323409
• On a series of finite automata defining free transformation groups.
• Semigroups arising from asynchronous automata.

This page was built for publication: Automata with restricted memory and shift endomorphisms

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