Automata cascades: expressivity and sample complexity
Every automaton can be decomposed into a cascade of basic prime automata. This is the Prime Decomposition Theorem by Krohn and Rhodes. Guided by this theory, we propose automata cascades as a structured, modular, way to describe automata as complex systems made of many components, each implementing...
| Главные авторы: | , , |
|---|---|
| Формат: | Conference item |
| Язык: | English |
| Опубликовано: |
Association for the Advancement of Artificial Intelligence
2023
|