Computing in permutation groups without memory

DOI10.4086/cjtcs.2014.007zbMath1319.68090arXiv1310.6008OpenAlexW2100124210MaRDI QIDQ5173197

Maxmilien Gadouleau, Peter J. Cameron, Ben T. Fairbairn

Publication date: 9 February 2015

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

permutation groupsgenerating setssymmetric groupalternating groupBoolean networksmemoryless computationsequential updates

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Permutation groups (20B99)

Related Items (6)

Synchronizing Boolean networks asynchronously ⋮ Attractor separation and signed cycles in asynchronous Boolean networks ⋮ Fixing monotone Boolean networks asynchronously ⋮ Memoryless computation: new results, constructions, and extensions ⋮ Complete simulation of automata networks ⋮ On simulation in automata networks

Cites Work

• Closed iterative calculus
• Elementary decompositions of arbitrary maps over finite sets
• On the Maximality of Psl(D + 1, q ), d ⩾ 2

This page was built for publication: Computing in permutation groups without memory