ホーム
探索
nav.journalClub
トレンド
その他
synapse
⌘+K
言語
日本語
Sweeping permutation automata | Synapse
March 3, 2026
Sweeping permutation automata
MR
Maria Radionova
St Petersburg University
AO
Alexander Okhotin
St Petersburg University
Key Points
Sweeping permutation automata enhance computation capabilities, impacting algorithm efficiency.
Crucial dynamics were identified, suggesting potential applications in various computational fields.
Theoretical exploration of automata was utilized to derive new computational insights.
Findings may revolutionize certain areas in computational modeling and design.
Mark Helpful
Like
Save
Bookmark
Relay
Share
Cite This Study
Copy
Radionova et al. (Sat,) studied this question.
synapsesocial.com/papers/69a75f6cc6e9836116a2ac9a
https://doi.org/https://doi.org/10.1007/s00236-025-00519-6
Mark Helpful
Like
Save
Bookmark
Relay
Share